Abstract
In [3] J. Esparza presented an interesting characterization of structurally live and structurally bounded Free-Choice Nets (LBFC-Nets). Exploiting this characterization in combination with new results and refined algorithms the authors formulate an O(¦P∥T∥F¦) algorithm deciding whether a Free-Choice Net is a LBFC-Net or not. Furthermore the algorithm contains a simple and efficient test to ensure that the initial marking of a LBFC-Net is live. This test is based on a simplified characterization of liveness for LBFC-Nets.
This article was processed using the LATEX macro package with LLNCS style
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Best,E.: Some Classes of Live and Safe Petri Nets, in K.Voss, H.J.Genrich, G.Rozenberg: ”Concurrency and Nets, Advances of Petri Nets”, Springer, Berlin 1887.
Esparza,J.: Minimal Deadlocks in Free Choice Nets, Hildesheimer Informatikberichte 1/89, Institut für Informatik, Universität Hildesheim
Esparza,J.: Synthesis Rules for Petri Nets, and How They Lead to New Results, Hildesheimer Informatikberichte 5/90, Institut für Informatik, Universität Hildesheim.
Esparza,J.;Silva,M.: A Polynomial-Time Algorithm to Decide Liveness of Bounded Free Choice Nets, Hildesheimer Informatikberichte 12/90, Institut für Informatik, Universität Hildesheim.
Hack,M.H.T.: Analysis of Production Schemata by Petri Nets, TR-94, MIT, Boston 1972 corrected june 1974
Jones,N.;Landweber,L.;Lien,Y.: Complexity of some Problems in Petri Nets, Theoretical Computer Science, Vol 4, pp. 277–299, 1977.
Lautenbach,K.: Linear Algebraic Calculation of Deadlocks and Traps in K.Voss, H.J.Genrich, G.Rozenberg: “Concurrency and Nets, Advances in Petri Nets”, Springer, Berlin 1987.
Mehlhorn,K.: Data Structures and Algorithms 2: Graph Algorithms and NP-Completeness, EATCS Monographs on Theoretical Computer Science, Springer, Berlin Heidelberg 1984.
Starke,P.: Analysetechniken von Petri-Netz-Modellen, Teubner, Stuttgart 1990 (in German).
Stewart,G.W.: Introduction to Matrix Computations, Academic Press, New York, 1973.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kemper, P., Bause, F. (1992). An efficient polynomial-time algorithm to decide liveness and boundedness of free-choice 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_15
Download citation
DOI: https://doi.org/10.1007/3-540-55676-1_15
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