Abstract
A class of Petri nets called regular marked nets is introduced. Its definition refers to the linear algebraic representation of nets. It is shown that every regular marked net is live — i.e. no transition can get deadlocked — and bounded — i.e. its state space is finite. In turn, live and bounded marked extended free choice nets are a proper subclass of regular marked nets. A series of results concerning behavioural properties — i.e. properties of the corresponding state graph — which are known for live and bounded marked extended free choice nets are shown to hold for regular marked nets.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Alimonti,P.; Feuerstein,E.: Petri Nets, Hypergraphs and Conflicts. Proc. Graph-Theoretical Concepts in Computer Science WG'92, LNCS 657 (1992) 293–309
Best,E.; Desel,J.: Partial Order Behaviour and Structure of Petri Nets. Formal Aspects of Computing 2 (2) (1990) 123–138
Best,E.; Desel,J.; Esparza,J.: Traps Characterise Home States in Free Choice Systems. Theoretical Computer Science 101 (1992) 161–176
Best,E.; Voss,K.: Free Choice Systems have Home States. Acta Informatica 21 (1984) 89–100
Campos,J.; Chiola,G.; Silva,M.: Properties and Performance Bounds for Closed Free Choice Synchronized Monoclass Queueing Networks. IEEE Transactions on Automatic Control AC-36 (12) (1991) 1368–1382
Colom,J.M.; Campos,J.; Silva,M.: On Liveness Analysis Through Linear Algebraic Techniques. Departamento de Ingenieria Electrica e Informatica, Universidad de Zaragoza, Research Report GISI-RR-90-11 (1990)
Desel,J.: A Proof of the Rank Theorem for Extended Free Choice Nets. Proc. Application and Theory of Petri Nets 1992, LNCS 616 (1992) 134–153
Desel,J.; Esparza,J.: Reachability in Cyclic Extended Free-Choice Systems. Theoretical Computer Science 114 (1993) 93–118
Desel,J.; Esparza,J.: Shortest Paths in Reachability Graphs. Proc. Application and Theory of Petri Nets 1993, LNCS 619 (1993) 224–241
Esparza,J.: Synthesis Rules for Petri Nets, and How they Lead to New Results. Proc. CONCUR'90, LNCS 458 (1990) 182–198
Esparza,J.; Silva,M.: On the Analysis and Synthesis of Free Choice Systems. Advances in Petri Nets 1990, LNCS 483 (1991) 243–286
Hack, M.: Petri Net Languages. MIT Laboratory Computer Science TR-159 (1976)
Jantzen,M.: Complexity of Place/Transition Nets. Petri Nets: Central Models and their Properties, LNCS 254 (1987) 413–434
Reisig,W.: Petri Nets. EATCS Monographs on Theoretical Computer Science 4, Springer-Verlag (1985)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Desel, J. (1994). Regular marked Petri nets. In: van Leeuwen, J. (eds) Graph-Theoretic Concepts in Computer Science. WG 1993. Lecture Notes in Computer Science, vol 790. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57899-4_58
Download citation
DOI: https://doi.org/10.1007/3-540-57899-4_58
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57899-4
Online ISBN: 978-3-540-48385-4
eBook Packages: Springer Book Archive