Bounded LTL model checking with stable models

@article{Heljanko2001BoundedLM,
  title={Bounded LTL model checking with stable models},
  author={Keijo Heljanko and Ilkka Niemel{\"a}},
  journal={Theory and Practice of Logic Programming},
  year={2001},
  volume={3},
  pages={519 - 550}
}
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… 
View on Cambridge Press
arxiv.org
130 Citations
Highly Influential Citations
12
Background Citations
41
Methods Citations
39
Results Citations
3

130 Citations

Bounded Model Checking for the Universal Fragment of CTL

The concept of bounded model checking can be extended to ACTL (the universal fragment of CTL) and the implementation of the algorithm for Elementary Net Systems is described together with the experimental results.

Parallel Program Verification Using BMC

A simple programming language, PROMELAb, is introduced and an operational semantics for it is defined and it is shown how it can be used to check bounded reachability properties and how the approach extends to handling safety properties.

On bounded model checking of asynchronous systems

This dissertation demonstrates that given a system of LTSs and a bound, a BMC formula modeling the executions of the products applying partial-order semantics and on-the-fly determinization can be created efficiently.

Bounded Model Checking Approaches for Verification of Distributed Time Petri Nets

This work gives a translation of BMC to SAT and describes a BDD-based BMC for both LTL−X and ECTL−X, focusing on the properties expressed in Linear Temporal Logic without the neXt-time operator.

Combining symbolic and partial order methods for model checking 1-safe Petri nets

This work shows that, if the only thing one can assume from a prefix is that it is complete, nested reachability properties are relatively hard, and model checking is PSPACE-complete in the size of the complete finite prefix.

Checking MTL Properties of Discrete Timed Automata via Bounded Model Checking

The existential model checking problem for MTL is translated to the existential model Checking problem for a variant of linear temporal logic (called HLTL), and a SAT-based bounded model checking method is provided for HLTL.

Model Checking Abstract State Machines with Answer Set Programming

This paper presents a method of applying ASP to BMC of ASMs and shows how to efficiently translate the BMC problem for the ASM into a problem of answer set computation.

SMT-based scenario verification for hybrid systems

This paper proposes a novel approach, that exploits the structure of the scenario to partition and drive the search, both for bounded model checking and k-induction, and fully leverages the advanced features of modern SMT solvers, such as incrementality, unsatisfiable core extraction, and interpolation.

SMT-based scenario verification for hybrid systems

This paper proposes a novel approach, that exploits the structure of the scenario to partition and drive the search, both for bounded model checking and k-induction, and fully leverages the advanced features of modern SMT solvers, such as incrementality, unsatisfiable core extraction, and interpolation.

Verification of Action Theories in ASP: A Complete Bounded Model Checking Approach

The paper proposes an approach to bounded model checking (BMC) which exploits the Buchi automaton construction while searching for a counterexample, with the aim of achieving completeness.
...

References

SHOWING 1-10 OF 28 REFERENCES

Answer Set Programming and Bounded Model Checking

Bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming and some experimental results indicate that the approach is quite competitive when searching for short executions of the system leading to deadlock.

Bounded Reachability Checking with Process Semantics

This work translates the bounded reachability problem for 1-safe Petri nets into constrained Boolean circuit satisfiability and considers three semantics: process, step, and interleaving semantics, showing that process semantics has often the best performance for bounded reachable checking.

Symbolic Model Checking without BDDs

This paper shows how boolean decision procedures, like Stalmarck's Method or the Davis & Putnam Procedure, can replace BDDs, and introduces a bounded model checking procedure for LTL which reduces model checking to propositional satisfiability.

Using Logic Programs with Stable Model Semantics to Solve Deadlock and Reachability Problems for 1-Safe Petri Nets

In this work, it is shown that instead of using mixed integer programming, a constraint-based logic programming framework can be employed, and a linear-size translation from deadlock detection in prefixes into the problem of finding a stable model of a logic program is presented.

Improving the Encoding of LTL Model Checking into SAT

This paper tackles the problem of improving BMC encodings for the full class of LTL properties by noticing some properties of the encoding of [2], and exploiting them to define improvements that make the resulting boolean formulas smaller or simpler to solve.

Model Checking

Model checking is applied concurrently with system design, and particularly in its early stages when systems are modelled at a high level of abstraction, because the payoff of finding bugs at that stage is highest whereas the costs are low.

Model Checking of Safety Properties

An analysis of safety properties is presented that enables us to prevent the doubly-exponential blow up and to use the same automaton used for model checking of general properties, replacing the search for bad cycles by a search for finite bad prefixes.

Symbolic Model Checking: 10^20 States and Beyond

Model Checking Linear Temporal Logic Using Tabled Logic Programming

This abstract describes how a model checker for LTL is constructed using tabled LP and presents a programming abstraction of "in ationary negation" (inot) which is used to encode the strongly connected component (SCC) algorithm due to Kosaraju and Sharir described in [CLR89] (see Section 3).

XMC: A Logic-Programming-Based Verification Toolset

The core computational components of theXMC system, such as those for compiling the specification language, model checking, etc., are built on top of the XSB tabled logic-programming system.