Abstract
For several years, research has been done to establish relations between the liveness of a net and the structure of the underlying graph. This work has resulted in the proposition of polynomial algorithms to check liveness for particular classes of nets. In this paper, we present Extended Non Self-Controlling Nets, a class of nets that includes Extended Free-Choice Nets and Non Self-Controlling Nets. We develop some properties of this new class of nets and we propose polynomial algorithms whose application domain is wider than the domain of the previous algorithms.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
W. Reisig: Petri Nets. 2nd edition, Springer-Verlag, 1991.
J. Esparza, M. Silva: A Polynomial-Time Algorithm to Decide Liveness of Bounded Free-Choice Nets. Theoretical Computer Science, ∘ 102, pp 185–205, 1992.
K. Barkaoui, M. Minoux: A Polynomial-Time Graph Algorithm to Decide Liveness of Some Basic Classes of Bounded Petri Nets. In Application and Theory of Petri Nets 1992, LNCS n∘ 616, K. Jensen ed., Springer-Verlag, 1992, pp 62–75.
K. Lautenbach, H. Ridder: Liveness in Bounded Petri Nets which Are Covered by T-Invariants. In Application and Theory of Petri Nets 1994, Zaragoza, Spain, June 1994, LNCS n∘ 815, R. Valette ed., Springer-Verlag, 1994, pp 358–375.
P. Kemper, F. Bause: An Efficient Polynomial-Time Algorithm to Decide Liveness and Boundedness of Free-Choice Nets. In Application and Theory of Petri Nets 1992, LNCS n∘ 616, K. Jensen ed., Springer-Verlag, 1992, pp 263–278.
J. Desel: A Proof of the Rank Theorem for Extended Free Choice Nets. In Application and Theory of Petri Nets 1992, LNCS n∘ 616, K. Jensen ed., Springer-Verlag, 1992, pp 134–153.
F. Commoner: Deadlocks in Petri nets. In Applied Data Res. Inc., Wakefield, MA, 1972.
K. Barkaoui, B. Lemaire: An Effective Chararcterization of Minimal Deadlocks and Traps Based on Graph Theory. Proc. of the 10th International Conference on Application and Theory of Petri Nets, Bonn, Germany, June 1989.
W. Griese: Lebendigkeit in NSK Petri-Netzen. TU Muenchen Info n∘6, 1979.
M. Minoux, K. Barkaoui: Deadlocks and traps in Petri net as Horn-satisfiability solutions and some related polynomially solvable problems. In Discrete Applied Mathematics n∘ 29, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Barkaoui, K., Couvreur, J.M., Dutheillet, C. (1995). On liveness in Extended Non Self-Controlling Nets. In: De Michelis, G., Diaz, M. (eds) Application and Theory of Petri Nets 1995. ICATPN 1995. Lecture Notes in Computer Science, vol 935. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60029-9_32
Download citation
DOI: https://doi.org/10.1007/3-540-60029-9_32
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60029-9
Online ISBN: 978-3-540-49408-9
eBook Packages: Springer Book Archive