Abstract
This paper discusses liveness verification of discrete-event systems modeled by n-safe ordinary Petri nets. A Petri net is live, if it is possible to fire any transition from any reachable marking. The verification method we propose is based on a partial order method called network unfolding. Network unfolding maps the original Petri net to an acyclic occurrence net. A finite prefix of the occurrence net is defined to give a compact representation of the original net’s reachability graph. A set of transition cycles is identified in the finite prefix. These cycles are then used to establish necessary and sufficient conditions that determine the original net’s liveness.
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.
Similar content being viewed by others
References
K. Barkaoui, Liveness of Petri nets and its relations with deadlocks, traps, and invariants, Report 92-06, Laboratoire CEDRIC-CNAM, Paris, France, 1995.
K. Barkaoui, J.F. Pradat-Peyre, On liveness and Controlled Siphons in Petri nets, in Application and Theory of Petri Nets, Springer Verlag, 1996.
F. Commoner, “Deadlocks in Petri Nets”, Wakefield, Applied Data Research, Inc., Report #CA-7206-2311, 1972.
J.C. Corbett and G.S. Avrunin, Using integer programming to verify general safety and liveness properties, Formal Methods in System Design: An International Journal, vol. 6, no. 1, pp. 97–123, January 1995.
J. Desel and J. Esparza, Free Choice Petri Nets, Cambridge Tracts in Theoretical Computer Science 40, Cambridge University Press 1995.
Engelfriet, J., Branching processes of Petri nets. Acta Informatica 28, 575–591, 1991.
Esparza, J., “Model checking using net unfoldings”. In M. G. Gaudel and J. P. Jouannaud, editors, TAPSOFT’93:Theory and Practice of Software Development. 4th Int. Joint Conference CAAP/FASE, Volume 668 of Lecture Notes in Computer Science, pp 613–628. Spring-verlag, 1993.
Kevin X. He and Michael D. Lemmon, “Liveness-enforcing supervision of n-safe ordinary Petri nets with uncontrollable transitions”, to appear in the proceedings of the 2000’s IFAC International Conference on Control Systems Design, special session on Petri nets, Slovakia, June 2000.
Kemper, P. and Bause, F., An efficient polynimial-time algorithm to decide liveness and boundedness of free choice nets, LNCS, No. 616:263–278, 1992.
A. Kondratyev, M. Kishinevsky, A. Taubin and S. Ten, “Structural approach for the analysis of Petri nets by reduced unfoldings”, Proceedings of the 17th International Conference on Application and Theory of Petri Nets, Osaka, Japan, June 24–28, 1996.
McMillan, K., “Using unfoldings to avoid the state explosion problem in the verification of asynchronous circuits”, in: Computer Aided Verification, Fourth International Workshop, CAV’92 (B.V. Bochmann and D.K. Probst, Eds.). Vol. 663 of Lecture Notes in Computer Science. Springer-Verlag. pp. 164–177, 1992.
McMillan, K., Symbolic Model Checking, Kluwer Academic Publishers, 1993.
Murata, T., “Petri nets: Properties, analysis, and applications”, Proceedings of the IEEE, 77(4):541–580.
Reisig, W. (1985). Petri Nets. Springer-Verlag, 1985.
Ridder, H. and Lautenbach, K., Liveness in bounded Petri nets which are covered by t-invariants, LNCS, No. 815:358–375, 1994.
A. Semenov, Verification and Synthesis of Asynchronous Control Circuits Using Petri Net Unfoldings, Newcastle upon Tyne, 1998.(British Lending Library DSC stock location number: DXN 016059).
R.S. Sreenivas, On the existence of supervisory control in discrete event dynamic systems modeled by controlled Petri nets. IEEE Trans. on Automatic Control, 42(7), July, 1997, pp. 928–945.
R.S. Sreenivas, On supervisory policies that enforce liveness in complete controlled Petri nets with directed cut-places and cut-transitions, in IEEE Trans. on Automatic Control, 44(6), June, 1999, pp. 1221–1225.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
He, K.X., Lemmon, M.D. (2000). Liveness Verification of Discrete Event Systems Modeled by n-Safe Ordinary Petri Nets. In: Nielsen, M., Simpson, D. (eds) Application and Theory of Petri Nets 2000. ICATPN 2000. Lecture Notes in Computer Science, vol 1825. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44988-4_14
Download citation
DOI: https://doi.org/10.1007/3-540-44988-4_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67693-5
Online ISBN: 978-3-540-44988-1
eBook Packages: Springer Book Archive