Bounded LTL Model Checking with Stable Models

Reference:

Keijo Heljanko and Ilkka Niemelä. Bounded LTL model checking with stable models. In Thomas Eiter, Wolfgang Faber, and Mirosaw Truszczynski, editors, Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'2001), volume 2173 of Lecture Notes in Artificial Intelligence, pages 200–212, Vienna, Austria, September 2001. Springer-Verlag.

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.

Keywords:

bounded model checking, logic programming, stable models

Suggested BibTeX entry:

@inproceedings{HelNie:LPNMR2001,
    address = {Vienna, Austria},
    author = {Keijo Heljanko and Ilkka Niemel{\"a}},
    booktitle = {Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'2001)},
    editor = {Thomas Eiter and Wolfgang Faber and Mirosaw Truszczynski},
    month = {September},
    pages = {200--212},
    publisher = {Springer-Verlag},
    series = {Lecture Notes in Artificial Intelligence},
    title = {Bounded {LTL} Model Checking with Stable Models},
    volume = {2173},
    year = {2001},
}