Bounded LTL Model Checking with Stable Models
| dc.creator | Heljanko, Keijo | |
| dc.creator | Niemelä, Ilkka | |
| dc.date | 2003-05-23 | |
| dc.date.accessioned | 2026-07-07T03:19:43Z | |
| dc.date.available | 2026-07-07T03:19:43Z | |
| dc.description | 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 generalisation of communicating automata, 1-safe Petri nets, are used. It is shown how a 1-safe Petri net and a requirement on the behaviour 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. Correctness proofs of the devised translations are given, and some experimental results using the translation and the Smodels system are presented. | |
| dc.description | 32 pages, to appear in Theory and Practice of Logic Programming | |
| dc.identifier | https://arxiv.org/abs/cs/0305040 | |
| dc.identifier | http://arxiv.org/abs/cs/0305040 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/31574 | |
| dc.subject | Logic in Computer Science | |
| dc.subject | Artificial Intelligence | |
| dc.subject | D.2.4;D.2.2;F.4.1;I.2.4;F.3.1 | |
| dc.title | Bounded LTL Model Checking with Stable Models | |
| dc.type | text |