Liveness verification of discrete event systems modeled by n-safe ordinary petri nets

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1825, Issue , 2000, Pages 227-243

  He, Kevin X ^a   Lemmon, Michael D ^a  

^a University of Notre Dame   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PETRI NETS;

COMPACT REPRESENTATION; FINITE PREFIX; LIVENESS VERIFICATIONS; OCCURRENCE NET; ORDINARY PETRI NET; PARTIAL-ORDER METHODS; REACHABILITY GRAPHS; VERIFICATION METHOD;

DISCRETE EVENT SIMULATION;

EID: 0011341942     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44988-4_14     Document Type: Conference Paper

References (18)

1. K. Barkaoui, Liveness of Petri nets and its relations with deadlocks, traps, and invariants, Report 92-06, Laboratoire CEDRIC-CNAM, Paris, France, 1995.
2. K. Barkaoui, J.F. Pradat-Peyre, On liveness and Controlled Siphons in Petri nets, in Application and Theory of Petri Nets, Springer Verlag, 1996.
3. F. Commoner, "Deadlocks in Petri Nets", Wakefield, Applied Data Research, Inc., Report #CA-7206-2311, 1972.
4. J.C. Corbett and G.S. Avrunin, Using integer programming to verify general safety and liveness properties, Formal Methods in System Design: An Inter- national Journal, vol. 6, no. 1, pp. 97-123, January 1995.
5. J. Desel and J. Esparza, Free Choice Petri Nets, Cambridge Tracts in Theo- retical Computer Science 40, Cambridge University Press 1995.
6. Engelfriet, J., Branching processes of Petri nets. Acta Informatica 28, 575-591, 1991.
7. Esparza, J., "Model checking using net unfoldings". In M. G. Gaudel and J. P. Jouannaud, editors, TAPSOFT'93:Theory and Practice of Software Devel- opment. 4th Int. Joint Conference CAAP/FASE, Volume 668 of Lecture Notes in Computer Science, pp 613-628. Spring-verlag, 1993.
8. 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.
9. 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.
10. 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.
11. McMillan, K., "Using unfoldings to avoid the state explosion problem in the veri_cation 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.
12. McMillan, K., Symbolic Model Checking, Kluwer Academic Publishers, 1993.
13. Murata, T., "Petri nets: Properties, analysis, and applications", Proceedings of the IEEE, 77(4):541-580.
14. Reisig, W. (1985). Petri Nets. Springer-Verlag, 1985.
15. Ridder, H. and Lautenbach, K., Liveness in bounded Petri nets which are covered by t-invariants, LNCS, No. 815:358-375, 1994.
16. A. Semenov, Verification and Synthesis of Asynchronous Control Circuits Us- ing Petri Net Unfoldings, Newcastle upon Tyne, 1998.(British Lending Library DSC stock location number: DXN 016059).
17. R.S. Sreenivas, On the existence of supervisory control in discrete event dy- namic systems modeled by controlled Petri nets. IEEE Trans. on Automatic Control, 42(7), July, 1997, pp. 928-945.
18. R.S. Sreenivas, On supervisory policies that enforce liveness in complete con- trolled Petri nets with directed cut-places and cut-transitions, in IEEE Trans. on Automatic Control, 44(6), June, 1999, pp. 1221-1225.