Abstract
This contributions provides an introduction to the theory of place/transition Petri nets. Topics include the sequential and the concurrent behavior of place/ transition Petri nets, marking graphs and coverability trees, and some analysis techniques that are based on the structure of place/transition Petri 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
E. Best and J. Desel. Partial order behaviour and structure of Petri nets. Formal Aspects of Computing 2(2):123–138, 1990.
E. Best and C. Fernandez C. Nonsequential Processes — a Petri Net View. EATCS Monographs on Theoretical Computer Science Vol. 13, Springer-Verlag, 1988.
W. Brauer (Ed.) Net Theory and Applications. Vol. 84 of Lecture Notes in Computer Science, Springer-Verlag, 1980.
W. Brauer, W. Reisig and G. Rozenberg (eds.). Petri nets: Central Models and Their Properties, Advances in Petri Nets 1986, part I, Vol. 254 of Lecture Notes in Computer Science, Springer-Verlag, 1987.
J. Desel and J. Esparza. Free Choice Petri Nets, Vol. 40 of Cambridge Tracts in Theoretical Computer Science, Cambridge University Press, 1995.
J. Desel and A. Merceron. P/T-systems as abstractions of C/E-systems. G. Rozenberg (ed.): Advances in Petri Nets 1989, Vol. 424 of Lecture Notes in Computer Science, Springer-Verlag, 1989.
J. Desel. Basic linear algebraic techniques for place/transition nets. Advanced Course on Petri Nets, 1996, in this volume.
J. Esparza and M. Nielsen. Decidability issues for Petri nets. GI Petri Net Newsletter, 47:5–23, 1994.
J. Esparza. Decdability and complexity of Petri net problems — an introduction. Advanced Course on Petri Nets, 1996, in this volume.
U. Goltz. On condition/event representation of place/ transition nets. K. Voss, H.J. Genrich and P.S. Thiagarajan (eds.): Concurrency and Nets, pp. 217–231, Springer-Verlag, 1990.
U. Goltz and W. Reisig. The non-sequential behaviour of Petri nets. Information and Control, 3:125–147, 1983.
M. Jantzen. Complexity of place/transition nets. In [BRR87], pp. 413–435.
M. Jantzen and R. Valk. Formal properties of place/transition nets. In [Brau80], pp. 165–21.
K. Jensen. An introduction to the practical use of coloured Petri nets. Advanced Course on Petri Nets, 1996, in this volume.
S.R. Kosaraju. Decidability of reachablity in vector addition systems. 14th Annual ACM Symposium on Theory of Computing, San Francisco, pp. 267–281, 1982.
K. Lautenbach. Linear algebraic techniques for place/ transition nets. In [BRR87], pp. 142–167.
E.W. Mayr. An algorithm for the general Petri net reachability problem. SIAM Journal of Computing, 13(3):441–459, 1984.
T. Murata. Petri net: properties, analysis and application. Proceedings of the IEEE 77(4):541–580, 1989.
J. L. Peterson. Petri net Theory and the Modelling of Systems. Prentice-Hall, Englewood Cliffs, 1981.
W. Reisig. Petri Nets. EATCS Monographs on Theoretical Computer Science Vol. 4, Springer-Verlag, 1985.
W. Reisig. Place/transition systems. In [BRR87], pp. 117–141.
C. Reutenauer. The Mathematics of Petri Nets. Masson (1988).
G. Rozenberg and J. Engelfriet. Elementary net systems. Advanced Course on Petri Nets, 1996, in this volume.
A, Valmari. The state explosion problem. Advanced Course on Petri Nets, 1996, in this volume.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Desel, J., Reisig, W. (1998). Place/transition Petri Nets. In: Reisig, W., Rozenberg, G. (eds) Lectures on Petri Nets I: Basic Models. ACPN 1996. Lecture Notes in Computer Science, vol 1491. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-65306-6_15
Download citation
DOI: https://doi.org/10.1007/3-540-65306-6_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65306-6
Online ISBN: 978-3-540-49442-3
eBook Packages: Springer Book Archive