A simulation model of an interface in a layered protocol architecture, such as the one defined by the Open Systems Interconnection Basic Reference Model, is presented. The interface is designed to operate between any two protocol layers, and to relieve the protocol machines of the management of data unit queues. The simulation model is developed using PROTOB, an object-oriented simulation environment based on Prot nets, a class of colored Petri nets with timed transitions. Different buffer allocation policies in the interface are compared by showing their simulated performance results.<>
{"title":"A simulation model of a uniform interface for layered protocol architectures","authors":"M. Marsan, G. P. Rossi, F. Salvi","doi":"10.1109/PNPM.1989.68549","DOIUrl":"https://doi.org/10.1109/PNPM.1989.68549","url":null,"abstract":"A simulation model of an interface in a layered protocol architecture, such as the one defined by the Open Systems Interconnection Basic Reference Model, is presented. The interface is designed to operate between any two protocol layers, and to relieve the protocol machines of the management of data unit queues. The simulation model is developed using PROTOB, an object-oriented simulation environment based on Prot nets, a class of colored Petri nets with timed transitions. Different buffer allocation policies in the interface are compared by showing their simulated performance results.<<ETX>>","PeriodicalId":366060,"journal":{"name":"Proceedings of the Third International Workshop on Petri Nets and Performance Models, PNPM89","volume":"224 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122379823","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Harushi Someya, Tsutomu Tashiro, T. Murata, N. Komoda
An automatic method for computing the expected execution time of jobs based on Petri nets is proposed. With this method a job operation flow is modeled using the timed Petri net, all operation cases for every fault are considered using the reachability tree of the Petri net, and the expected execution time is computed automatically. A support system that actualizes the proposed method on a workstation is described. This approach allows job operation flows to be planned without misunderstandings.<>
{"title":"Performance evaluation of job operation flows in computer systems by timed Petri nets","authors":"Harushi Someya, Tsutomu Tashiro, T. Murata, N. Komoda","doi":"10.1109/PNPM.1989.68544","DOIUrl":"https://doi.org/10.1109/PNPM.1989.68544","url":null,"abstract":"An automatic method for computing the expected execution time of jobs based on Petri nets is proposed. With this method a job operation flow is modeled using the timed Petri net, all operation cases for every fault are considered using the reachability tree of the Petri net, and the expected execution time is computed automatically. A support system that actualizes the proposed method on a workstation is described. This approach allows job operation flows to be planned without misunderstandings.<<ETX>>","PeriodicalId":366060,"journal":{"name":"Proceedings of the Third International Workshop on Petri Nets and Performance Models, PNPM89","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114608487","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Jensen's colored Petri nets (CP-nets) are extended by including capacity and inhibitor functions. A class of extended CP-nets, known as P-nets, is defined that includes the capacity function and the threshold inhibitor extension. The inhibitor extension is defined in a totally symmetrical way to the usual pre-place map (or incidence function). Two transformations from P-nets to CP-nets are presented and it is proved that they preserve interleaving behavior. The transformations are based on the notion of complementary places defined for place/transition-nets and involve the definition and proof of a new extended complementary place invariant for CP-nets.<>
{"title":"Extensions to coloured Petri nets","authors":"J. Billington","doi":"10.1109/PNPM.1989.68540","DOIUrl":"https://doi.org/10.1109/PNPM.1989.68540","url":null,"abstract":"Jensen's colored Petri nets (CP-nets) are extended by including capacity and inhibitor functions. A class of extended CP-nets, known as P-nets, is defined that includes the capacity function and the threshold inhibitor extension. The inhibitor extension is defined in a totally symmetrical way to the usual pre-place map (or incidence function). Two transformations from P-nets to CP-nets are presented and it is proved that they preserve interleaving behavior. The transformations are based on the notion of complementary places defined for place/transition-nets and involve the definition and proof of a new extended complementary place invariant for CP-nets.<<ETX>>","PeriodicalId":366060,"journal":{"name":"Proceedings of the Third International Workshop on Petri Nets and Performance Models, PNPM89","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128868972","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Many-sorted high-level nets (MHLNs) combine abstract data types and Petri nets within the same algebraic framework and include inhibitor arcs and place capacities. Many-sorted signatures are used to define inscriptions. MHLNs are defined at two different levels of abstraction. At an abstract level markings and capacities are defined by terms. This is suitable for specifying classes of systems. At the concrete level, a many-sorted algebra satisfying the signature is used for markings and capacities. Both abstract and concrete MHLNs can be given an interpolation in terms of colored Petri nets extended by place capacities and inhibitors, known as P-nets. A hierarchy of high-level nets, including many-sorted versions of predicate-transition (PrT) nets and algebraic nets, is developed and differences from their single-sorted versions are discussed.<>
{"title":"Many-sorted high-level nets","authors":"J. Billington","doi":"10.1109/PNPM.1989.68550","DOIUrl":"https://doi.org/10.1109/PNPM.1989.68550","url":null,"abstract":"Many-sorted high-level nets (MHLNs) combine abstract data types and Petri nets within the same algebraic framework and include inhibitor arcs and place capacities. Many-sorted signatures are used to define inscriptions. MHLNs are defined at two different levels of abstraction. At an abstract level markings and capacities are defined by terms. This is suitable for specifying classes of systems. At the concrete level, a many-sorted algebra satisfying the signature is used for markings and capacities. Both abstract and concrete MHLNs can be given an interpolation in terms of colored Petri nets extended by place capacities and inhibitors, known as P-nets. A hierarchy of high-level nets, including many-sorted versions of predicate-transition (PrT) nets and algebraic nets, is developed and differences from their single-sorted versions are discussed.<<ETX>>","PeriodicalId":366060,"journal":{"name":"Proceedings of the Third International Workshop on Petri Nets and Performance Models, PNPM89","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130926938","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Recently the authors have shown that there is a class of stochastic Petri nets (SPNs), distinct from queueing networks, that also have a product-form equilibrium distribution.In this study the previous work is extended by study in SPNs that have arbitrarily distributed enabling and firing times, probabilistic input and output bags, and colored tokens. An embedding procedure that reduces a complex SPN to a skeleton SPN is proposed. It is shown that choosing the appropriate embedding, it is possible to obtain exact results from the skeleton SPN that are marginal results for the complex SPN.<>
{"title":"Aggregation methods in exact performance analysis of stochastic Petri nets","authors":"W. Henderson, P. Taylor","doi":"10.1109/PNPM.1989.68535","DOIUrl":"https://doi.org/10.1109/PNPM.1989.68535","url":null,"abstract":"Recently the authors have shown that there is a class of stochastic Petri nets (SPNs), distinct from queueing networks, that also have a product-form equilibrium distribution.In this study the previous work is extended by study in SPNs that have arbitrarily distributed enabling and firing times, probabilistic input and output bags, and colored tokens. An embedding procedure that reduces a complex SPN to a skeleton SPN is proposed. It is shown that choosing the appropriate embedding, it is possible to obtain exact results from the skeleton SPN that are marginal results for the complex SPN.<<ETX>>","PeriodicalId":366060,"journal":{"name":"Proceedings of the Third International Workshop on Petri Nets and Performance Models, PNPM89","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114203754","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The modeling of flexible manufacturing systems (FMS) under uncertainty and evaluation of a rule base for online scheduling is considered. To represent uncertain events in FMS, such as failure of machine tools, repair time and processing time, apply continuous-time and discrete-time stochastic Petri nets with hierarchical structure to constructing the FMS model. To obtain an efficient schedule of FMS with on-line real-time basis, the authors construct a rule base and evaluate the performance of the rule base using the FMS simulation system.<>
{"title":"Modeling of FMS under certainty using stochastic Petri nets-an application to rule-based on-line scheduling","authors":"I. Hatono, N. Katoh, K. Yamagata, H. Tamura","doi":"10.1109/PNPM.1989.68546","DOIUrl":"https://doi.org/10.1109/PNPM.1989.68546","url":null,"abstract":"The modeling of flexible manufacturing systems (FMS) under uncertainty and evaluation of a rule base for online scheduling is considered. To represent uncertain events in FMS, such as failure of machine tools, repair time and processing time, apply continuous-time and discrete-time stochastic Petri nets with hierarchical structure to constructing the FMS model. To obtain an efficient schedule of FMS with on-line real-time basis, the authors construct a rule base and evaluate the performance of the rule base using the FMS simulation system.<<ETX>>","PeriodicalId":366060,"journal":{"name":"Proceedings of the Third International Workshop on Petri Nets and Performance Models, PNPM89","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116021452","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A lumping method that is based on a particular class of colored Petri nets is presented. The originality of the method is that the states are aggregated a priori, thus avoiding the construction of the whole reachability graph. The authors construct only a graph of symbolic markings whose states are classes of markings and from which the solution can be directly computed. They show on an example that the method can be usefully applied to the performance evaluation of symmetric systems.<>
{"title":"Aggregation of states in colored stochastic Petri nets: application to a multiprocessor architecture","authors":"C. Dutheillet, S. Haddad","doi":"10.1109/PNPM.1989.68538","DOIUrl":"https://doi.org/10.1109/PNPM.1989.68538","url":null,"abstract":"A lumping method that is based on a particular class of colored Petri nets is presented. The originality of the method is that the states are aggregated a priori, thus avoiding the construction of the whole reachability graph. The authors construct only a graph of symbolic markings whose states are classes of markings and from which the solution can be directly computed. They show on an example that the method can be usefully applied to the performance evaluation of symmetric systems.<<ETX>>","PeriodicalId":366060,"journal":{"name":"Proceedings of the Third International Workshop on Petri Nets and Performance Models, PNPM89","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115555580","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The problem of computing both upper and lower bounds for the steady-state performance of timed and stochastic marked graphs is studied. In particular, linear programming problems defined on the incidence matrix of the underlying Petri nets to compute tight (i.e. reachable) bounds for the throughput of transitions for live and bounded marked graphs with time associated with transitions are considered. These bounds depend on the initial marking and the mean values of the delays but not on the probability distributions (thus including both the deterministic and the stochastic cases). Connections between results and techniques typical of qualitative and quantitative analysis of Petri models are stressed.<>
{"title":"Tight polynomial bounds for steady-state performance of marked graphs","authors":"J. Campos, G. Chiola, J. Colom, M. Suárez","doi":"10.1109/PNPM.1989.68553","DOIUrl":"https://doi.org/10.1109/PNPM.1989.68553","url":null,"abstract":"The problem of computing both upper and lower bounds for the steady-state performance of timed and stochastic marked graphs is studied. In particular, linear programming problems defined on the incidence matrix of the underlying Petri nets to compute tight (i.e. reachable) bounds for the throughput of transitions for live and bounded marked graphs with time associated with transitions are considered. These bounds depend on the initial marking and the mean values of the delays but not on the probability distributions (thus including both the deterministic and the stochastic cases). Connections between results and techniques typical of qualitative and quantitative analysis of Petri models are stressed.<<ETX>>","PeriodicalId":366060,"journal":{"name":"Proceedings of the Third International Workshop on Petri Nets and Performance Models, PNPM89","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128274225","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A natural and compact way to incorporate nonexponential distributions into stochastic Petri nets is described. It allows users to directly specify the nonexponential transitions at the next level without providing the detailed construction; for example, to specify an Erlang distribution, the user only needs to provide the number of stages and the mean of the distribution. The refinement of the transition with a general distribution is performed automatically with a net-independent mechanism. The resulting net is a GSPN that can be solved with standard techniques. The authors also show how to expand conflicting transitions under the race-enabling policy (without the interconnection of places and transitions internal to the expansion of the different transitions), and have identified the different semantics introduced by nonexponential distributions, when a model does or does not use a control place.<>
{"title":"Alternative methods for incorporating non-exponential distributions into stochastic timed Petri nets","authors":"S. C. Bruell, Pozung Chen, G. Balbo","doi":"10.1109/PNPM.1989.68552","DOIUrl":"https://doi.org/10.1109/PNPM.1989.68552","url":null,"abstract":"A natural and compact way to incorporate nonexponential distributions into stochastic Petri nets is described. It allows users to directly specify the nonexponential transitions at the next level without providing the detailed construction; for example, to specify an Erlang distribution, the user only needs to provide the number of stages and the mean of the distribution. The refinement of the transition with a general distribution is performed automatically with a net-independent mechanism. The resulting net is a GSPN that can be solved with standard techniques. The authors also show how to expand conflicting transitions under the race-enabling policy (without the interconnection of places and transitions internal to the expansion of the different transitions), and have identified the different semantics introduced by nonexponential distributions, when a model does or does not use a control place.<<ETX>>","PeriodicalId":366060,"journal":{"name":"Proceedings of the Third International Workshop on Petri Nets and Performance Models, PNPM89","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133507512","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
SPNP, a powerful GSPN package that allows the modeling of complex system behaviors, is presented. Advanced constructs are available in SPNP such as marking-dependent arc multiplicities, enabling functions, arrays of places or transitions, and subnets; the full expressive power of the C programming language is also available to increase the flexibility of the net description. Sophisticated steady-state and transient solvers are available including cumulative and up-to-absorption measures. The user is not limited to a predefined set of measures; detailed expressions reflecting exactly the measures sought can be easily specified. The authors conclude by comparing SPNP with two other SPN-based packages, Great SPN and METASAN.<>
{"title":"SPNP: stochastic Petri net package","authors":"G. Ciardo, J. Muppala, Kishor S. Trivedi","doi":"10.1109/PNPM.1989.68548","DOIUrl":"https://doi.org/10.1109/PNPM.1989.68548","url":null,"abstract":"SPNP, a powerful GSPN package that allows the modeling of complex system behaviors, is presented. Advanced constructs are available in SPNP such as marking-dependent arc multiplicities, enabling functions, arrays of places or transitions, and subnets; the full expressive power of the C programming language is also available to increase the flexibility of the net description. Sophisticated steady-state and transient solvers are available including cumulative and up-to-absorption measures. The user is not limited to a predefined set of measures; detailed expressions reflecting exactly the measures sought can be easily specified. The authors conclude by comparing SPNP with two other SPN-based packages, Great SPN and METASAN.<<ETX>>","PeriodicalId":366060,"journal":{"name":"Proceedings of the Third International Workshop on Petri Nets and Performance Models, PNPM89","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114794729","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：