For the most recent entries see the Petri Nets Newsletter.

Bounded LTL Model Checking with Stable Models.

Heljanko, Keijo; Niemelä, Ilkka

In: LNAI 2173: Logic Programming and Nonmonotonic Reasoning, pages 200-pp. 6th International Conference, LPNMR 2001, Vienna, Austria, September 17-19, 2001, Proceedings / T. Eiter,W. Faber, M. Truszczyski (Eds.) --- Springer Verlag, September 2001.

Abstract: In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. As the model of asynchronous systems a generalization of communicating automata, 1-safe Petri nets, are used. It is shown how a 1-safe Petri net and a requirement on the behavior of the net can be translated into a logic program such that the bounded model checking problem for the net can be solved by computing stable models of the corresponding program. The use of the stable model semantics leads to compact encodings of bounded reachability and deadlock detection tasks as well as the more general problem of bounded model checking of linear temporal logic. Some experimental results on solving deadlock detection problems using the translation and the Smodels system are presented.

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

Back to the Petri Nets Bibliography