Abstract
For more than 40 years Petri nets [1] serve as an efficient formal model of concurrent behavior of complex discrete systems. There exists a rich bibliography of books and works devoted to these methods and many applications of nets have been already created. The model is extremely simple: it uses three basic concepts, of places, of transitions, and of a flow relation. The behavior of a net is represented by changing distribution of tokens situated in the net places, according to some simple rules (so-called firing rules). Non-negative integers play essential role in the description of tokens distribution, indicating the number of tokens contained in nets places and . Transitions determine way of changing the distribution, taking off a number of tokens from entry places and putting a number of tokens in exit places of an active transition. Formally, to any transition some operations on numbers stored in places are assigned and therefore the behavior of nets is described by means of a simple arithmetic with adding or subtracting operations on non-negative integers.
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
Petri, C.A.: Concepts of Net Theory. In: Proc. of MFCS’73, High Tatras, Math.Institut of Slovak Academy of Sciences, pp. 137–146 (1973)
Mazurkiewicz, A.: Semantics of Concurrent Systems: A Modular Fixed Point Trace Approach, Instituut voor Toegepaste Wiskunde en Informatica, Rijksuniversiteit Leiden, TR-84-19 (1984)
Shields, M.W.: Non-sequential behaviour, part I. Int. Report CSR-120-82, Dept. of Computer Science, University of Edinburgh (1979)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Mazurkiewicz, A. (2007). Petri Nets Without Tokens. In: Kleijn, J., Yakovlev, A. (eds) Petri Nets and Other Models of Concurrency – ICATPN 2007. ICATPN 2007. Lecture Notes in Computer Science, vol 4546. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73094-1_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-73094-1_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73093-4
Online ISBN: 978-3-540-73094-1
eBook Packages: Computer ScienceComputer Science (R0)