{"title":"Stepwise refinements of net models and their place invariants","authors":"W. M. Zuberek","doi":"10.1109/PNPM.1999.796556","DOIUrl":"https://doi.org/10.1109/PNPM.1999.796556","url":null,"abstract":"Schedules for manufacturing cells can be systematically derived by simple stepwise refinements which, in consecutive steps, increase the complexity of the cell by introducing its components one after another. Timed Petri net models of schedules derived in this way have some convenient structural properties-net models are covered by conflict-free subnets, determined by place invariants of the model. These place invariant implied subnets can be used for evaluation of the basic performance characteristics of the model. The paper shows that place invariants of net models of schedules can be obtained by the same stepwise refinements that are used for model derivation. Simple examples of performance evaluation are included as an illustration of the use of place invariants in the analysis of schedules.","PeriodicalId":283809,"journal":{"name":"Proceedings 8th International Workshop on Petri Nets and Performance Models (Cat. No.PR00331)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125211363","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}
{"title":"Non equivalence between time Petri nets and time stream Petri nets","authors":"M. Boyer, M. Diaz","doi":"10.1109/PNPM.1999.796566","DOIUrl":"https://doi.org/10.1109/PNPM.1999.796566","url":null,"abstract":"It had been shown that Merlin's Time Petri Nets are a special case of Time Stream Petri Nets. In this paper, we show that there does not exist a time equivalence between both models. We extend first this result to the non equivalence of Timed Automata and Time Petri Nets and second to the non equivalence of Timed Link Petri Net and Timed Transition Petri Net.","PeriodicalId":283809,"journal":{"name":"Proceedings 8th International Workshop on Petri Nets and Performance Models (Cat. No.PR00331)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131502454","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}
{"title":"A mapping of autonomous net condition event systems to GSPNs","authors":"P. Kemper","doi":"10.1109/PNPM.1999.796560","DOIUrl":"https://doi.org/10.1109/PNPM.1999.796560","url":null,"abstract":"The software design for automatic controller in manufacturing systems shows lower complexity than for other applications but has high requirements for correctness, robustness and performance. Net condition event systems (NCES) are a net-based modelling formalism recently developed for this task. In this paper we give an interpretation of autonomous NCES in terms of generalized stochastic Petri nets (GSPNs) such that the tangible reachability graph of a GSPN coincides with the reachability graph of a NCES. This gives the opportunity to employ GSPN techniques for functional and quantitative analysis of NCES models.","PeriodicalId":283809,"journal":{"name":"Proceedings 8th International Workshop on Petri Nets and Performance Models (Cat. No.PR00331)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114714058","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}
{"title":"Integrated frameworks for multi-level and multi-formalism modeling","authors":"W. Sanders","doi":"10.1109/PNPM.1999.796527","DOIUrl":"https://doi.org/10.1109/PNPM.1999.796527","url":null,"abstract":"There have been significant advances in methods for specifying and solving models that aim to predict the performance and dependability of computer systems and networks. At the same time, however, there have been dramatic increases in the complexity of the systems whose performance and dependability must be evaluated, and considerable increases in the expectations of analysts that use performance/dependability evaluation tools. This paper briefly reviews the progress that has been made in the development of performance/dependability evaluation tools, and argues that the next important step is the creation of modeling frameworks and software environments that support multi-level, multi-formalism modeling and multiple solution methods within a single integrated framework. In addition, this paper presents an overview of the Mobius project, which aims to provide a modeling framework and software environment that support multiple modeling formalisms, methods for model composition and connection, and a way to integrate multiple analytical/numerical- and simulation-based model solution methods. Finally, it suggests research that must take place to make this aim a reality, and thus facilitate the performance and dependability evaluation of complex computer systems and networks.","PeriodicalId":283809,"journal":{"name":"Proceedings 8th International Workshop on Petri Nets and Performance Models (Cat. No.PR00331)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129906211","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}
{"title":"Optimal control of (min,+) linear time-varying systems","authors":"S. Lahaye, J. Boimond, L. Hardouin","doi":"10.1109/PNPM.1999.796563","DOIUrl":"https://doi.org/10.1109/PNPM.1999.796563","url":null,"abstract":"The class of discrete event dynamic systems involving only synchronization phenomena can be seen as linear time-invariant systems in a particular algebraic structure called (min,+) algebra. In the same framework, this paper deals with linear time-varying systems, that is, systems whose parameters may change as functions of time. For example, in a manufacturing system the number of working machines, or the number of trains running in a closed network of railway connections, can vary as functions of time. For such systems, the output tracking problem is optimally solved under just-in-time criterion.","PeriodicalId":283809,"journal":{"name":"Proceedings 8th International Workshop on Petri Nets and Performance Models (Cat. No.PR00331)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125053852","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}
{"title":"On state space decomposition for the numerical analysis of stochastic Petri nets","authors":"C. Perez-Jimenez, J. Campos","doi":"10.1109/PNPM.1999.796530","DOIUrl":"https://doi.org/10.1109/PNPM.1999.796530","url":null,"abstract":"Net-driven decomposition techniques are considered in this paper in order to reduce the state explosion problem for the computation of performance indices of stochastic Petri nets. Basically, the idea is to represent (or partially represent) in a decomposed manner the reachability graph of the model so it can be used for exact and/or approximated performance analysis. In that way, the complete storing of the graph is avoided and, for the case of approximate analysis, the solution of the isomorphous continuous time Markov chain is substituted by the solution of smaller components. The techniques are applied to a couple of non-trivial models.","PeriodicalId":283809,"journal":{"name":"Proceedings 8th International Workshop on Petri Nets and Performance Models (Cat. No.PR00331)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128034154","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}
{"title":"On the rational use of Petri nets, automata and the max algebra for the optimal control of DEDS","authors":"E. Wagneur, I. Demongodin","doi":"10.1109/PNPM.1999.796564","DOIUrl":"https://doi.org/10.1109/PNPM.1999.796564","url":null,"abstract":"We show here how the discrete Petri nets, languages and automata, and max-algebra approaches to DEDS yield complementary results. Using a simple discrete event dynamic system, we show how this complementarity may be used for the optimal control of a DEDS: the conditions ensuring liveness of the Petri net model yield admissible control strategies; the automaton of the system then exhibits nondeterministic situations, and suggest unambiguous control policies. Each of these policies can then be analysed. In each case, we get general timed PNs, which are not TEGs, and spectral theory in the min-max algebra yield the periodicity of the system. An optimal control strategy may then be selected.","PeriodicalId":283809,"journal":{"name":"Proceedings 8th International Workshop on Petri Nets and Performance Models (Cat. No.PR00331)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128784123","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}
{"title":"On the efficient sequential and distributed generation of very large Markov chains from stochastic Petri nets","authors":"B. Haverkort, Alexander Bell, H. Bohnenkamp","doi":"10.1109/PNPM.1999.796528","DOIUrl":"https://doi.org/10.1109/PNPM.1999.796528","url":null,"abstract":"In this paper we present efficient techniques for the generation of very large continuous-time Markov chains (CTMCs) specified as stochastic Petri nets (SPNs). In particular, we investigate how the storage efficiency of the reachability graph generation can be improved by using good state coding techniques and by using hashing tables instead of tree-based data structures. These techniques allow us to analyse SPNs with almost 55 million states on a single workstation. The size of the SPNs that can be handled is then further enlarged by using a cluster of workstations. With 16 workstations, connected via a 100 Mbps Ethernet, we can generate reachability graphs with over 400 million states in reasonable time. The presented techniques have been realised in a prototype tool (PARSECS) implemented in C++ using the libraries STL and MPICH. The SPNs to be input to PARSECS are specified using CSPL, known from the tool SPNP. In the paper we present our techniques and study their performance for a number of case studies. We also present comparisons with SPNP.","PeriodicalId":283809,"journal":{"name":"Proceedings 8th International Workshop on Petri Nets and Performance Models (Cat. No.PR00331)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115126758","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}
{"title":"Clarifying the priority specification of GSPN: Detached priorities","authors":"Enrique Teruel, G. Franceschinis, M. Pierro","doi":"10.1109/PNPM.1999.796558","DOIUrl":"https://doi.org/10.1109/PNPM.1999.796558","url":null,"abstract":"The global multilevel priority definition in GSPN, while being most convenient with many respects, poses some modelling problems related with confusion and indirect conflicts, which may lead to undesired effects in the definition of the underlying stochastic process. While some of these problems have been recognized and dealt with in previous works on the definition of GSPN, through the introduction of extended conflict sets, some others, that will be illustrated in this paper, were not covered. To overcome all these problems, in this paper a syntactical subclass of GSPN, called detached priorities GSPN (dpGSPN), is proposed. In dpGSPN no confusion or indirect conflicts are possible, and according to our experience, modelling power is not substantially sacrificed. To facilitate the modelling, a possible method to derive a suitable global priority definition from local information is outlined.","PeriodicalId":283809,"journal":{"name":"Proceedings 8th International Workshop on Petri Nets and Performance Models (Cat. No.PR00331)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127742406","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}
{"title":"A data structure for the efficient Kronecker solution of GSPNs","authors":"G. Ciardo, A. Miner","doi":"10.1109/PNPM.1999.796529","DOIUrl":"https://doi.org/10.1109/PNPM.1999.796529","url":null,"abstract":"Kronecker-based approaches have been proposed for the solution of structured GSPNs with extremely large state spaces. Representing the transition rate matrix using Kronecker sums and products of smaller matrices virtually eliminates its storage requirements, but introduces various sources of overhead. We show how, by using a new data structure which we call matrix diagrams, we are able to greatly reduce or eliminate many of these overheads, resulting in a very efficient overall solution process.","PeriodicalId":283809,"journal":{"name":"Proceedings 8th International Workshop on Petri Nets and Performance Models (Cat. No.PR00331)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123848528","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}