Abstract
We study a series of structural restrictions which gives rise to a set of classes of marked nets: S-systems, T-systems, free choice systems and asymmetric choice systems. This series of restrictions corresponds to a series of behavioural properties of marked nets first introduced by C.A.Petri — sequentially, determinacy and confusion-freeness.
For each one of these restrictions, we address the question to what extent the behaviour of a marked net is determined by the structure of the underlying net. In particular, we study the characterisation of liveness and the characterisation of safeness in the presence of liveness. The paper presents strengthened, streamlined and elementary proofs of some important results.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
E. Best: Structure Theory of Petri Nets: the Free Choice Hiatus. Advanced Course on Petri Nets, Bad Honnef (September 1986), to appear in Springer Lecture Notes in Computer Science.
E. Best and C. Fernández: Notations and Terminology on Petri Net Theory. Arbeitspapiere der GMD No.195 (1986).
F. Commoner: Deadlocks in Petri Nets. Report, Applied Data Inc., CA-7206-2311 (1972).
F. Commoner, A.W Holt, S. Even and A. Pnueli: Marked Directed Graphs. JCSS Vol.5, 511–523 (1971).
J. Desel: A Structural Property of Free Choice Systems. Petri Net Newsletters No.25, 16–20 (December 1986).
K. Döpp: Zum Hack’schen Wohlformungssatz für Free-Choice-Petrinetze. EIK 19/1-2, 3–15 (1983).
H.J. Genrich and K. Lautenbach: Synchronisationsgraphen. Acta Informatica Vol.2, 143–161 (1973).
H.J. Genrich and P.S. Thiagarajan: A Theory of Bipolar Synchronisation Schemes. TCS Vol.30, 241–318 (1984).
M. Hack: Analysis of Production Schemata by Petri Nets. TR-94, MIT-MAC (1972).
M. Hack: Corrections to MAC-TR-94. Computation Structure Notes 17, MIT-MAC (1974).
M. Jantzen and R. Valk: Formal Properties of Place/Transition-Nets. Springer Lecture Notes in Computer Science Vol.84, 165–212 (1980).
R. Johnsonbaugh and T. Murata: Additional Methods for Reduction and Expansion of Marked Graphs. IEEE Tr. on Circuits and Systems, Vol.28/10, 1009–1014 (1981).
C.A. Petri: Concepts of Net Theory. Mathematical Foundations of Computer Science, Proceedings of Symposium and Summer School, High Tatras, 137–148 (1973).
C.A. Petri: Interpretations of Net Theory. GMD-ISF Report 75-07 (1975).
W. Reisig: Petri Nets — an Introduction. Springer EATCS Monographs (1985).
G. Rozenberg and P.S. Thiagarajan: Petri Nets: Basic Notions, Structure and Behaviour. Springer Lecture Notes in Computer Science Vol.224, 585–668 (1986).
P.S. Thiagarajan and K. Voss: A Fresh Look at Free Choice Nets. Information and Control, Vol.61/2, 85–113 (1984).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Best, E., Thiagarajan, P.S. (1987). Some Classes of Live and Safe Petri Nets. In: Voss, K., Genrich, H.J., Rozenberg, G. (eds) Concurrency and Nets. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-72822-8_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-72822-8_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-72824-2
Online ISBN: 978-3-642-72822-8
eBook Packages: Springer Book Archive