Bounded LTL Model Checking with Stable Models

Details Bounded LTL Model Checking with Stable Models Bounded LTL Model Checking with Stable Models

2003-05-23

arxiv.org/abs/cs/0305040v1

Computer Science

Logic in Computer Science

32 pages, to appear in Theory and Practice of Logic Programming

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Bounded LTL Model Checking with Stable Models does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Bounded LTL Model Checking with Stable Models, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bounded LTL Model Checking with Stable Models will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-133404