Abstract
A new concurrency relation for ordinary Petri nets is introduced. It gives the necessary condition for every pair of places to be marked at some marking. Irreflexiveness of this relation proves to be the sufficient condition of safety of ordinary Petri nets and necessary and sufficient condition of safety of live EFC nets. The complexity of this relation computing has a polynomial upper bound of O(XS), where X is the number of vertices of a net.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
E.Best, J.Desel: Partial order behaviour and structure of Petri nets. Formal Aspects of Computing Vol.2 No.2, (1990) 123–138.
G.Berthelot: Checking properties of nets using transformation.-In: Advances in Petri nets, 1985. LNCS, 222, 1986, 19–40.
E.Best: The relative strength of K-density. LNCS, 84, 1980, 261–276.
J.Esparza, M.Silva: A polynomial-time Algorithm to decide Liveness of Bounded Free Choice Nets. Hildeshelmer Informatikberichte Nr.12/90.
J.Esparza: Structure Theory of Free Choice Nets, PhD Thesis-Universidad Zaragoza (90).
J.Desel, J.Esparza: Reachability in Reversible Free Choice Systems, LNCS 480: STACS 91.
F.Commoner, A.W.Holt, S.Even, A.Pnueli: Marked Directed Graphs. J.Comput. Syst. Sci., Vol.5, (1971) 511–523.
M.T.Hack: Analysis of production schemata by Petri nets, TR-94, MIT, Cambridge, MA, 1972, pp.119. Corrections 1974.
R.Janicki: Nets, Sequential Components and Concurrency Relations. Theoretical Computer Science 29 (1984) 87–121.
N.D.Jones, L.H.Landweber, Y.E.Lien: Complexity of some Problem in Petri nets. Theoretical Computer Science 4, (1977) 277–299.
M.Jantzen, R.Valk: Formal Properties of Place-Transition Nets. LNCS 84, 1980, 165–212.
C.A.Petri: Concurrency. LNCS, 84, 1980, 251–260.
A.D.Zakrevsky: To the Theory of Concurrent Logic Control Algorithms. Izv. AN SSSR. Engineering Cybernetics, 1989. no.5. pp.79–91. In Russian.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kovalyov, A.V. (1992). Concurrency relations and the safety problem for Petri nets. In: Jensen, K. (eds) Application and Theory of Petri Nets 1992. ICATPN 1992. Lecture Notes in Computer Science, vol 616. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55676-1_17
Download citation
DOI: https://doi.org/10.1007/3-540-55676-1_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55676-3
Online ISBN: 978-3-540-47270-4
eBook Packages: Springer Book Archive