For the most recent entries see the Petri Nets Newsletter.

Model Checking LTL Using Constraint Programming.

Esparza, Javier; Melzer, Stephan

In: Azéma, P.; Balbo, G.: Lecture Notes in Computer Science, Vol. 1248: 18th International Conference on Application and Theory of Petri Nets, Toulouse, France, June 1997, pages 1-20. Berlin, Germany: Springer-Verlag, June 1997.

Abstract: The model-checking problem for 1-safe Petri nets and lineartime temporal logic (LTL) consists of deciding, given a 1-safe Petri net and a formula of LTL, whether the Petri net satisfies the property encoded by the formula. This paper introduces a semidecision test for this problem. By a semidecision test we understand a procedure which may answer `yes', in which case the Petri net satisfies the property, or `don't know'. The test is based on a variant of the so called automata-theoretic approach to model-checking and on the notion of T-invariant. We analyse the computational complexity of the test, implement it using 2lp - a constraint programming tool, and apply it to two case studies.

Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography