Abstract
We give a sketch of the theory of Petri nets. The aspects that we concentrate on are the basic notions of the theory and the interplay between the structure and behaviour of distributed systems as modelled by Petri nets. The theory we present is confined to a restricted class of Petri nets called safe Petri nets which correspond essentially to systems that have finite state spaces.
Starting with an elementary system model based on safe nets we first introduce the basic notions of net theory such as sequence, conflict, concurrency and confusion. We then introduce a number of (increasingly sophisticated) behavioural notions such as firing sequences, traces and processes. Next we identify a number of structural subclasses of safe Petri nets and show how they guarantee behavioural properties such as sequentiality, determinism and lack of confusion. We then present the major results concerning these subclasses. Towards the end of the paper we give a quick sketch of the theory of non-sequential processes based on Petri nets. We also show one way of generalizing the elementary system model considered in the paper so that powerful net-based tools for modelling and analysing large scale distributed systems may be constructed.
Preview
Unable to display preview. Download preview PDF.
20. References
IJ.J. Aalbersberg, G. Rozenberg: Theory of traces, Institute of Applied Mathematics and Computer Science, University of Leiden, Technical Report No. 85-16 (1985).
E. Best: A Theorem on the Characteristics of Non-Sequential Processes. Fundamenta Informaticae III.1 (1980), pp. 77–94.
E. Best: The Relative Strength of K-density. LNCS 84 (1980).
F. Commoner, A.W. Holt, S. Even, A. Pnueli: Marked Directed Graphs. Journal of Computer and System Sciences 5 (1971), pp. 511–523.
F. Commoner: Deadlocks in Petri Nets. Applied Data Research Inc., Wakefield, Massachusetts, USA, Report No. CA-7206-2311.
C. Fernandez, P.S. Thiagarajan: D-Continuous Causal Nets: A Model of Non-Sequential Processes. Theoretical Computer Science 28 (1984), pp. 171–196.
C. Fernandez, M. Nielsen, P.S. Thiagarajan: A Note on Observable Occurrence Nets. LNCS 188 (1984), pp. 122–138.
H.J. Genrich, K. Lautenbach: Synchronisationsgraphen, Acta Informatica 2 (1973), pp. 143–161 (in German).
H.J. Genrich, K. Lautenbach: System Modelling with High Level Petri Nets. Theoretical Computer Science 13 (1981), pp. 109–136.
H.J. Genrich, K. Lautenbach, P.S. Thiagarajan: Elements of General Net Theory. LNCS 84 (1980).
H.J. Genrich, K. Lautenbach, P.S. Thiagarajan: Substitution Systems — A Family of System Models Based on Concurrency. LNCS 88 (1980), pp. 698–723.
H.J. Genrich, P.S. Thiagarajan: A Theory of Bipolar Synchronisation Schemes. Theoretical Computer Science 30 (1984), pp. 241–318.
H.J. Genrich, P.S. Thiagarajan: Well-Formed Flowcharts for Concurrent Programming. In: Formal Description of Programming Concepts — II, D. Bjørner (ed.), North-Holland Publ. Comp. (1983), pp. 357–380.
U. Goltz, W. Reisig: The Non-Sequential Behaviour of Petri Nets. Information and Control, Vol. 57, Nos 2–3 (1983), pp. 125–147.
M.H.T. Hack: Analysis of Production Schemata by Petri Nets, TR 94, Project MAC, M.I.T., Cambridge, Massachusetts, USA (1972).
M.H.T. Hack: Petri Net Languages. Computation Structures Group Memo 124, Project MAC, M.I.T. Cambridge, Massachusetts, USA (1976).
A.W. Holt, H. Saint, R. Shapiro, S. Warshall: Final Report of the Information Systems Theory Project. Technical Report RADC-TR-68-305, Rome Air Development Center, Griffis Airforce Base, New York (1968). Distributed by Clearing House for Federal Scientific and Technical Information, U.S. Department of Commerce.
H.J. Hoogeboom, G. Rozenberg: Case graphs for condition/event systems: syntactic properties, manuscript (1985).
M. Jantzen: On the Hierarchy of Petri Net Languages. R.A.I.R.O. Informatique Théorique/Theoretical Informatics, Vol. 19, No. 1 (1979), pp. 19–30.
M. Jantzen, R. Valk: Formal Properties of Place/Transition Systems. LNCS 84 (1980).
K. Jensen: Coloured Petri Nets and the Invariant Method. Theoretical Computer Science 14 (1981), pp. 317–336.
J.R. Jump, P.S. Thiagarajan: On the Equivalence of Asynchronous Control Structures. SIAM Journal of Computing, Vol. 2, No. 2 (1973), pp. 67–87.
R.M. Karp, R.E. Miller: Parallel Program Schemata. Journal of Computer and System Sciences 3 (1969), pp. 147–195.
K. Lautenbach: Liveness in Petri Nets. Internal Report GMD-ISF-72.02.1, GMD, St. Augustin, W. Germany (1972).
A. Mazurkiewicz: Concurrent Program Schemes and their Interpretation. Report DAIMI PB-78, Computer Science Department, Aarhus University, Aarhus, Denmark (1978).
A. Mazurkiewicz: Semantics of Concurrent Systems: A Modular Fixed-Point Trace Approach. LNCS 188 (1984), pp. 353–375.
M. Nielsen, G. Plotkin, G. Winskel: Petri Nets, Event Structures and Domains, Part I, Theoretical Computer Science 13 (1981), pp. 85–108.
J.L. Peterson: Computation Sequence Sets. Journal of Computer and System Sciences 13, 1 (1976), pp. 1–24.
C.A. Petri: Kommunikation mit Automaten. Schriften des Institutes für Instrumentelle Mathematik, Bonn. W. Germany (1962). (In German.)
C.A. Petri: Grundsätzliches zur Beschreibung Diskreter Progresse. Drittes Kolloquium über Automaten Theorie, Birhäuser Verlag, Basel, Switzerland (1967), pp. 121–140. (In German.)
C.A. Petri: Concepts of Net Theory. Mathematical Foundations of Computer Science, Proceedings of Symposium and Summer School, High Tatras (1973), pp. 137–146.
C.A. Petri: Non-Sequential Processes. Internal Report GMD-ISF-77.5, GMD, St. Augustin, W. Germany (1977).
C.A. Petri: General Net Theory. Proceedings of the Joint IBM University of Newcastle upon Tyne Seminar on Computing System Design (1976).
C.A. Petri: Concurrency. LNCS 84 (1980).
C.A. Petri: State-Transition Structures in Physics and in Computation. International Journal of Theoretical Physics, Vol. 21, Nos 10/11 (1982).
W. Reisig: Petri Nets, An Introduction. EATCS Monographs on Theoretical Computer Science, Springer-Verlag (1985).
G. Rozenberg, R. Verraedt: Subsets languages of Petri nets, Part I, Theoretical Computer Science 26 (1983), pp. 301–326.
P. Starke: Free Petri Net Languages. LNCS 64 (1978), pp. 506–515.
P.S. Thiagarajan, K. Voss: A Fresh Look at Free Choice Nets. Information and Control, Vol. 61, No. 2 (1984), pp. 85–113.
R. Valk: Infinite Behaviour of Petri Nets. Theoretical Computer Science 25, 3 (1983), pp. 311–341.
J. Winkowski: Behaviours of Concurrent Systems. Theoretical Computer Science 12 (1980), pp. 39–60.
G. Winskel: Events in Computation. Ph.D. Thesis. Dept. of Computer Science, University of Edinburgh, Edinburgh, G.B. (1980).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Rozenberg, G., Thiagarajan, P.S. (1986). Petri nets: Basic notions, structure, behaviour. In: de Bakker, J.W., de Roever, W.P., Rozenberg, G. (eds) Current Trends in Concurrency. Lecture Notes in Computer Science, vol 224. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0027048
Download citation
DOI: https://doi.org/10.1007/BFb0027048
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16488-3
Online ISBN: 978-3-540-39827-1
eBook Packages: Springer Book Archive