Abstract
There are at least two main reasons for studying classes of Petri nets. First, many systems are specified as sets of communicating sequential processes, with formal rules of construction which give birth to special kind of structures ([Her 79], [BMR 80] or [LSB 79]). The second is theoretical. Analysis algorithms have an exponential complexity. In assuming some constraints on the structure of the net, one can hope to decrease this complexity substantially.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
G.W. Brams “Réseau de Petri: Théorie et Pratique” (tome 1) Masson - Paris (1982)
G. Berthelot, G. Memmi and W. Reisig “A control structure for sequential processes synchronized by buffers.” Internal report.
F. Commoner “Deadlock in Petri nets” Applied Data Research Inc. Wakefield Mass. CA. 7206–2311 (1972)
W. Griese “Lebendikeit in NSK - Petri - Netzen” Tec. Univ. München - TUM - INFO - 7906 (1979)
M. Hack “Analysis of production schemata by Petri nets” Technical Report TR-94 Projet MAC M.I.T. (1972)
O. Herzog “Static analysis of concurrent processes for dynamic properties using Petri nets.” Proc. of the Int. Symp.“Semantics of Concurrent Computation” Evian 1979. (G. Kahn Ed.) L.N.C.S. 70 Springer Verlag (July 1979 ) pp 66–90.
A.W. Holt and F. Commoner “Events and conditions” Applied Data Research Inc. New York (1970).
M. Jantzen and R. Valk “Formal properties of place transition nets” Proc. of Advanced Course on General Net Theory of Processes Systems - Hamburg (1979) (W. Brauer Ed.) Springer Verlag L.N.C.S. 84 (1980) pp. 165–212.
P.E. Lauer, M.W. Shields and E. Best “Formal theory of the basic COSY notation” Univ. of Newcastle-upon-Tyne, Comp. Lab. T.R. 143 (November 1979).
G. Memmi “Fuites et semi-flots dans les réseaux de Petri” Thesis of Docteur-Ingénieur, Univ. Pierre et Marie Curie, Paris, (December 1978).
J.M. Toudic “Algorithmes d’algèbre linéaire pour l’analyse structurelle des réseaux de Petri” Revue Technique Thomson-CSF, Vol. 14, n° 1 (March 1982), pp 137–156.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1983 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Memmi, G. (1983). A Graph Theoretical Property for Minimal Deadlock. In: Pagnoni, A., Rozenberg, G. (eds) Applications and Theory of Petri Nets. Informatik-Fachberichte, vol 66. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-69028-0_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-69028-0_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-12309-5
Online ISBN: 978-3-642-69028-0
eBook Packages: Springer Book Archive