Pub Date : 1991-12-02DOI: 10.1109/PNPM.1991.238771
W. Henderson, D. Lucic
The authors apply some results from the theory of insensitivity to stochastic Petri nets. In doing so exact equilibrium distributions are derived for the aggregation and disaggregation of a class of stochastic Petri nets.<>
{"title":"Exact results in the aggregation and disaggregation of stochastic Petri nets","authors":"W. Henderson, D. Lucic","doi":"10.1109/PNPM.1991.238771","DOIUrl":"https://doi.org/10.1109/PNPM.1991.238771","url":null,"abstract":"The authors apply some results from the theory of insensitivity to stochastic Petri nets. In doing so exact equilibrium distributions are derived for the aggregation and disaggregation of a class of stochastic Petri nets.<<ETX>>","PeriodicalId":137470,"journal":{"name":"Proceedings of the Fourth International Workshop on Petri Nets and Performance Models PNPM91","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1991-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133402786","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}
Pub Date : 1991-12-02DOI: 10.1109/PNPM.1991.238793
H. Kantz, Kishor S. Trivedi
Analytical reliability modeling is a promising method for predicting the reliability of different architectural variants and to perform trade-off studies at design time. However, generating a computationally tractable analytic model implies in general an abstraction and idealization of the real system. Construction of such a tractable model is not an exact science, and as such, it depends on the modeler's intuition and experience. This freedom can be used in formulating the same problem by more than one approach. Such a N-version modeling approach increases the confidence in the results. In this paper, we analyze the MARS architecture with the dependability evaluation tools SHARPE and SPNP, employing several different techniques including: hierarchical modeling, stochastic Petri nets, folding of stochastic Petri nets, and state truncation. The authors critically examine these techniques for their practicability in modeling complex fault-tolerant computer architectures.<>
{"title":"Reliability modeling of the MARS system: a case study in the use of different tools and techniques","authors":"H. Kantz, Kishor S. Trivedi","doi":"10.1109/PNPM.1991.238793","DOIUrl":"https://doi.org/10.1109/PNPM.1991.238793","url":null,"abstract":"Analytical reliability modeling is a promising method for predicting the reliability of different architectural variants and to perform trade-off studies at design time. However, generating a computationally tractable analytic model implies in general an abstraction and idealization of the real system. Construction of such a tractable model is not an exact science, and as such, it depends on the modeler's intuition and experience. This freedom can be used in formulating the same problem by more than one approach. Such a N-version modeling approach increases the confidence in the results. In this paper, we analyze the MARS architecture with the dependability evaluation tools SHARPE and SPNP, employing several different techniques including: hierarchical modeling, stochastic Petri nets, folding of stochastic Petri nets, and state truncation. The authors critically examine these techniques for their practicability in modeling complex fault-tolerant computer architectures.<<ETX>>","PeriodicalId":137470,"journal":{"name":"Proceedings of the Fourth International Workshop on Petri Nets and Performance Models PNPM91","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1991-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116193739","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}
Pub Date : 1991-12-02DOI: 10.1109/PNPM.1991.238795
R. Zurawski, T. Dillon
The use of generic models in the synthesis of FMSs, which allows for rapid modelling and analysis, does not reduce complexity of the verification model. This complexity can be reduced by replacing the constituent components (generic models) with their functional abstractions, which represent the external behaviour of the components. In the paper, for a class of Petri net models representing primary components of FMSs, a method that allows to systematically construct functional abstractions is presented. This method is then used to obtain the functional abstraction of the Petri net model of a machining station.<>
{"title":"Systematic construction of functional abstractions of Petri net models of typical components of flexible manufacturing systems","authors":"R. Zurawski, T. Dillon","doi":"10.1109/PNPM.1991.238795","DOIUrl":"https://doi.org/10.1109/PNPM.1991.238795","url":null,"abstract":"The use of generic models in the synthesis of FMSs, which allows for rapid modelling and analysis, does not reduce complexity of the verification model. This complexity can be reduced by replacing the constituent components (generic models) with their functional abstractions, which represent the external behaviour of the components. In the paper, for a class of Petri net models representing primary components of FMSs, a method that allows to systematically construct functional abstractions is presented. This method is then used to obtain the functional abstraction of the Petri net model of a machining station.<<ETX>>","PeriodicalId":137470,"journal":{"name":"Proceedings of the Fourth International Workshop on Petri Nets and Performance Models PNPM91","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1991-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116454687","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}
Pub Date : 1991-12-02DOI: 10.1109/PNPM.1991.238797
E. Best
Gives an overview of the results of the Esprit Basic Research Action No.3128 DEMON (Design Methods Based on Nets). First, the aims, the approach and the initial setup of the project are described. Without attempting to be complete, the paper then outlines many of the results obtained in the project. It ends with an indication of possible future work.<>
概述了Esprit基础研究行动No.3128 DEMON (Design Methods Based on Nets)的研究成果。首先，介绍了项目的目标、方法和初始设置。在不试图完整的情况下，论文概述了项目中获得的许多结果。文章最后指出了未来可能开展的工作。
{"title":"Overview of the results of the Esprit basic research action DEMON-design methods based on nets","authors":"E. Best","doi":"10.1109/PNPM.1991.238797","DOIUrl":"https://doi.org/10.1109/PNPM.1991.238797","url":null,"abstract":"Gives an overview of the results of the Esprit Basic Research Action No.3128 DEMON (Design Methods Based on Nets). First, the aims, the approach and the initial setup of the project are described. Without attempting to be complete, the paper then outlines many of the results obtained in the project. It ends with an indication of possible future work.<<ETX>>","PeriodicalId":137470,"journal":{"name":"Proceedings of the Fourth International Workshop on Petri Nets and Performance Models PNPM91","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1991-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134296381","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}
Pub Date : 1991-12-02DOI: 10.1109/PNPM.1991.238785
G. Chiola, S. Donatelli, G. Franceschinis
Stochastic Petri nets (SPNs) and generalized stochastic Petri nets (GSPNs) are compared in order to investigate the role of immediate transitions. The comparison is based on the ability of the two formalisms to define models that can be 'scalable' with respect to the initial marking. An intermediate model between (G)SPN structures and (G)SPN systems called 'family' is introduced as a reference for the comparison. It is shown that GSPN families exist that do not have SPN counter- parts. An algorithm is given to reduce GSPN to SPN families in the cases in which this is possible. The application of this structural reduction algorithm allows a more efficient generation of the state space of GSPN systems.<>
{"title":"GSPNs versus SPNs: what is the actual role of immediate transitions?","authors":"G. Chiola, S. Donatelli, G. Franceschinis","doi":"10.1109/PNPM.1991.238785","DOIUrl":"https://doi.org/10.1109/PNPM.1991.238785","url":null,"abstract":"Stochastic Petri nets (SPNs) and generalized stochastic Petri nets (GSPNs) are compared in order to investigate the role of immediate transitions. The comparison is based on the ability of the two formalisms to define models that can be 'scalable' with respect to the initial marking. An intermediate model between (G)SPN structures and (G)SPN systems called 'family' is introduced as a reference for the comparison. It is shown that GSPN families exist that do not have SPN counter- parts. An algorithm is given to reduce GSPN to SPN families in the cases in which this is possible. The application of this structural reduction algorithm allows a more efficient generation of the state space of GSPN systems.<<ETX>>","PeriodicalId":137470,"journal":{"name":"Proceedings of the Fourth International Workshop on Petri Nets and Performance Models PNPM91","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1991-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125511321","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}
Pub Date : 1991-12-02DOI: 10.1109/PNPM.1991.238789
J. Campos, M. Suárez
Addresses the computation of upper bounds for the steady-state throughput of stochastic Petri nets with immediate and exponentially distributed service times of transitions. The authors try to deeply bridge stochastic Petri net theory to untimed Petri net and queueing network theories. Previous results for general service time distributions are improved for the case of Markovian nets by considering the slowest embedded subnet (generated by the support of left annullers of the incidence matrix of the net). The obtained results for the case of live and bounded free choice nets are of special interest. For such nets, the subnets generated by the left annullers of the incidence matrix can be seen as embedded product-form closed monoclass queueing networks, and efficient algorithms exist for their analysis.<>
{"title":"Throughput upper bounds for Markovian Petri nets: embedded subnets and queueing networks","authors":"J. Campos, M. Suárez","doi":"10.1109/PNPM.1991.238789","DOIUrl":"https://doi.org/10.1109/PNPM.1991.238789","url":null,"abstract":"Addresses the computation of upper bounds for the steady-state throughput of stochastic Petri nets with immediate and exponentially distributed service times of transitions. The authors try to deeply bridge stochastic Petri net theory to untimed Petri net and queueing network theories. Previous results for general service time distributions are improved for the case of Markovian nets by considering the slowest embedded subnet (generated by the support of left annullers of the incidence matrix of the net). The obtained results for the case of live and bounded free choice nets are of special interest. For such nets, the subnets generated by the left annullers of the incidence matrix can be seen as embedded product-form closed monoclass queueing networks, and efficient algorithms exist for their analysis.<<ETX>>","PeriodicalId":137470,"journal":{"name":"Proceedings of the Fourth International Workshop on Petri Nets and Performance Models PNPM91","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1991-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131259065","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}
Pub Date : 1991-12-02DOI: 10.1109/pnpm.1991.238774
D. Marinescu, M. Beaven, R. Stansifer
Parallel algorithms for the analysis of Petri net models are discussed. It is argued that the application of Petri nets in areas like performance modeling and software engineering lead to complex nets whose analysis can only be performed by exploiting the explicit parallelism in existing methods of analysis and by developing parallel analysis algorithms. The focus of this paper is the structural net analysis. A parallel algorithm for computing net invariants using a distributed memory multiprocessor system is presented. The paper discusses its implementation, and gives preliminary performance measurements.<>
{"title":"A parallel algorithm for computing invariants of Petri net models","authors":"D. Marinescu, M. Beaven, R. Stansifer","doi":"10.1109/pnpm.1991.238774","DOIUrl":"https://doi.org/10.1109/pnpm.1991.238774","url":null,"abstract":"Parallel algorithms for the analysis of Petri net models are discussed. It is argued that the application of Petri nets in areas like performance modeling and software engineering lead to complex nets whose analysis can only be performed by exploiting the explicit parallelism in existing methods of analysis and by developing parallel analysis algorithms. The focus of this paper is the structural net analysis. A parallel algorithm for computing net invariants using a distributed memory multiprocessor system is presented. The paper discusses its implementation, and gives preliminary performance measurements.<<ETX>>","PeriodicalId":137470,"journal":{"name":"Proceedings of the Fourth International Workshop on Petri Nets and Performance Models PNPM91","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1991-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114690714","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}
Pub Date : 1991-12-02DOI: 10.1109/PNPM.1991.238794
F. Archetti, A. Sciomachen, A. Gaivoronski
Considers the stochastic optimization approach for the optimal selection of dispatching rules of a robot handler in an automatic storage/retrieval system represented by a Petri Net (PN). In particular, the authors propose a combined simulation and optimization algorithm aimed at solving the conflict situations arising in the system due to simultaneous requests of the robot from objects in different queues. The theoretical optimization criteria are presented along with a case study.<>
{"title":"Optimal control policies for automated storage/retrieval system using PN models and stochastic optimization","authors":"F. Archetti, A. Sciomachen, A. Gaivoronski","doi":"10.1109/PNPM.1991.238794","DOIUrl":"https://doi.org/10.1109/PNPM.1991.238794","url":null,"abstract":"Considers the stochastic optimization approach for the optimal selection of dispatching rules of a robot handler in an automatic storage/retrieval system represented by a Petri Net (PN). In particular, the authors propose a combined simulation and optimization algorithm aimed at solving the conflict situations arising in the system due to simultaneous requests of the robot from objects in different queues. The theoretical optimization criteria are presented along with a case study.<<ETX>>","PeriodicalId":137470,"journal":{"name":"Proceedings of the Fourth International Workshop on Petri Nets and Performance Models PNPM91","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1991-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129616357","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}
Pub Date : 1991-12-02DOI: 10.1109/PNPM.1991.238796
H. Linde
Structure theory deals with connections between the behaviour of a system and the structure of the corresponding net. Structure theory is well developed for free choice nets. In the paper it is shown that with a notion of simulation close to bisimulation, it is impossible to simulate all confusion free nets with free choice nets.<>
{"title":"Free choice simulation of Petri nets","authors":"H. Linde","doi":"10.1109/PNPM.1991.238796","DOIUrl":"https://doi.org/10.1109/PNPM.1991.238796","url":null,"abstract":"Structure theory deals with connections between the behaviour of a system and the structure of the corresponding net. Structure theory is well developed for free choice nets. In the paper it is shown that with a notion of simulation close to bisimulation, it is impossible to simulate all confusion free nets with free choice nets.<<ETX>>","PeriodicalId":137470,"journal":{"name":"Proceedings of the Fourth International Workshop on Petri Nets and Performance Models PNPM91","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1991-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121263169","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}
Pub Date : 1991-12-02DOI: 10.1109/PNPM.1991.238777
C. Lakos, C. Keen
LOOPN is a language and simulator for specifying systems in terms of coloured timed Petri nets. It includes object-oriented features such as subtyping, inheritance and polymorphism which allow for the convenient modularisation of complex specifications. This paper briefly describes LOOPN and considers its application to the modelling of layered network protocols.<>
{"title":"Modelling layered protocols in LOOPN","authors":"C. Lakos, C. Keen","doi":"10.1109/PNPM.1991.238777","DOIUrl":"https://doi.org/10.1109/PNPM.1991.238777","url":null,"abstract":"LOOPN is a language and simulator for specifying systems in terms of coloured timed Petri nets. It includes object-oriented features such as subtyping, inheritance and polymorphism which allow for the convenient modularisation of complex specifications. This paper briefly describes LOOPN and considers its application to the modelling of layered network protocols.<<ETX>>","PeriodicalId":137470,"journal":{"name":"Proceedings of the Fourth International Workshop on Petri Nets and Performance Models PNPM91","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1991-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125122947","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
扫码关注我们
求助内容：
应助结果提醒方式：