Model-Checking with Coverability Graphs

Formal Methods in System Design

Volumn 15, Issue 3, 1999, Pages 239-254

  Schmidt, Karsten ^a  

^a HUMBOLDT UNIVERSITY   (Germany)

Author keywords

Petri nets; Temporal logic; Verification

Indexed keywords

EID: 0043265689     PISSN: 09259856     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008753219837     Document Type: Article

References (8)

1. E. Best and H. Fleischhack, "PEP: Programming environment based on petri nets," Technical report, University of Hildesheim, 1995.
2. J. Bradfield, "Proving temporal properties of Petri nets," Advances in Petri nets, pp. 29-47, 1991.
3. J. Esparza, "On the decidability of model checking for several μ-calculi and Petri nets," Proceedings of CAAP'94, LNCS 787, pp. 115-129, 1994.
4. A. Finkel, "A minimal coverability graph for Petri nets," Proc. of the 11th International Conference on Application and Theory of Petri nets, pp. 1-21, 1990.
5. M.H.T. Hack, "Decidability questions for Petri nets," Ph.D. Thesis, MIT, 1976.
6. G.E. Hughes and M.J. Creswell, An Introduction to Modal Logic, Methuen and Co., 1968.
7. R.M. Karp and R.E. Miller, "Parallel programm schemata," Journ. Computer and System Sciences, Vol. 4, pp. 147-195, May 1969.
8. H. Yen, "A unified approach for deciding the existence of certain Petri net paths," Information and Computation, Vol. 96, No. 1, pp. 119-137, 1992.