Hostname: page-component-7dd5485656-wxk4p Total loading time: 0 Render date: 2025-10-31T06:39:21.039Z Has data issue: false hasContentIssue false
  • English
  • Français

Bounded LTL model checking with stablemodels

Published online by Cambridge University Press:  31 July 2003

KEIJO HELJANKO  and
ILKKA NIEMELÄ
KEIJO HELJANKO
Affiliation:
Laboratory for Theoretical Computer Science, Department of Computer Science and Engineering, Helsinki University of Technology, P.O. Box 5400, FIN-02015 HUT, Finland (e-mail: Keijo.Heljanko@hut.fi)
ILKKA NIEMELÄ
Affiliation:
Laboratory for Theoretical Computer Science, Department of Computer Science and Engineering, Helsinki University of Technology, P.O. Box 5400, FIN-02015 HUT, Finland (e-mail: Ilkka.Niemela@hut.fi)
Get access Rights & Permissions [Opens in a new window]

Abstract

In this paper, bounded model checking of asynchronous concurrentsystems is introduced as a promising application area for answer setprogramming. As the model of asynchronous systems a generalisationof communicating automata, 1-safe Petri nets, are used. It is shownhow a 1-safe Petri net and a requirement on the behaviour of the netcan be translated into a logic program such that the bounded modelchecking problem for the net can be solved by computing stablemodels of the corresponding program. The use of the stable modelsemantics leads to compact encodings of bounded reachability anddeadlock detection tasks as well as the more general problem ofbounded model checking of linear temporal logic. Correctness proofsof the devised translations are given, and some experimental resultsusing the translation and the Smodels system are presented.

Information

Type
Regular Papers
Information
Theory and Practice of Logic Programming , Volume 3 , Issue 4-5 , July 2003 , pp. 519 - 550
Copyright
© 2003 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

Footnotes

This is an extended version of a paper titled “Bounded LTL modelchecking with stable models” presented at the 6thInternational Conference on Logic Programming and NonmonotonicReasoning (LPNMR' 2001), Vienna, Austria, September2001.