Bounded Model Checking

Biere, Armin; Cimatti, Alessandro; Clarke, Edmund M.; Strichman, Ofer; Zhu, Yunshan

doi:10.1016/s0065-2458(03)58003-2

Cited by 659 publications

(540 citation statements)

References 4 publications

Supporting

Mentioning

532

Contrasting

Unclassified

Order By: Relevance

“…Bounded Semantics of LTL [4], [5], [8], [9] Let AP be a set of atomic propositions., ranged over by p, q, · · ·. Then LTL formulas over AP are defined recursively as follows: atomic propositions are LTL formulas; and if φ 1 and φ 2 are LTL formulas so are Xφ (neXt),…”

Section: Bounded Ltl Model Checkingmentioning

confidence: 99%

See 1 more Smart Citation

Automated Route Planning for Milk-Run Transport Logistics with the NuSMV Model Checker

Kitamura

Okamoto

2013

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

SUMMARYIn this paper, we propose and implement an automated route planning framework for milk-run transport logistics by applying model checking techniques. First, we develop a formal specification framework for milk-run transport logistics. The framework adopts LTL (Linear Temporal Logic), a language based on temporal logics, as a specification language for users to be able to flexibly and formally specify complex delivery requirements for trucks. Then by applying the bounded semantics of LTL, the framework then defines the notion of "optimal truck routes", which mean truck routes on a given route map that satisfy given delivery requirements (specified by LTL) with the minimum cost. We implement the framework as an automated route planner using the NuSMV model checker, a state-of-the-art bounded model checker. The automated route planner, given route map and delivery requirements, automatically finds optimal trucks routes on the route map satisfying the given delivery requirements. The feasibility of the implementation design is investigated by analysing its computational complexity and by showing experimental results.

show abstract

Section: Bounded Ltl Model Checkingmentioning

confidence: 99%

“…We apply a model checking approach to realize this framework. The framework adopts LTL (Linear Temporal Logic) [4], [5] as a specification language for users to be able to flexibly specifying the delivery requirements in milk-run logistics, which are often complex w.r.t. the locations order of truck routing.…”

Section: Introductionmentioning

confidence: 99%

Automated Route Planning for Milk-Run Transport Logistics with the NuSMV Model Checker

Kitamura

Okamoto

2013

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

show abstract

“…Bounded model checking [6] uses a propositional SAT solver for the symbolic exploration of model checking problems. It exploits the SATPLAN exploration idea of [20] using a rising search horizon k to generate Boolean formulae encoding the overall exploration problem up the BFS-level k. In bounded automata-based model checking we use a similar approach, but without using BDDs nor SAT-formulae.…”

Section: Large-scale Model Checking Livenessmentioning

confidence: 99%

“…It exploits the SATPLAN exploration idea of [20] using a rising search horizon k to generate Boolean formulae encoding the overall exploration problem up the BFS-level k. In bounded automata-based model checking we use a similar approach, but without using BDDs nor SAT-formulae. To avoid traversing the full state space in Tarjan's algorithm, we analyze the cross product graph up to some threshold depth value k. If we find a counter-example already in depth k we terminate, otherwise we increase k. The bounded semantics for this strategy are the same as in BMC [6]: …”

Section: Large-scale Model Checking Livenessmentioning

confidence: 99%

Large-Scale Directed Model Checking LTL

Edelkamp

Jabbar

2006

Model Checking Software

View full text Add to dashboard Cite

Abstract. To analyze larger models for explicit-state model checking, directed model checking applies error-guided search, external model checking uses secondary storage media, and distributed model checking exploits parallel exploration on multiple processors. In this paper we propose an external, distributed and directed on-the-fly model checking algorithm to check general LTL properties in the model checker SPIN. Previous attempts restricted to checking safety properties. The worst-case I/O complexity is bounded by O(sort(|F||R|)/p + l · scan(|F ||S|)), where S and R are the sets of visited states and transitions in the synchronized product of the Büchi automata for the model and the property specification, F is the number of accepting states, l is the length of the shortest counterexample, and p is the number of processors. The algorithm we propose returns minimal lasso-shaped counterexamples and includes refinements for property-driven exploration.

show abstract

“…Symbolic Model Checking (Burch et al, 1990) has made the treatment of large statespaces possible by using special data structures (i.e., Binary Decision Diagrams) to encode them succinctly. More recently, Bounded Model Checking (Biere et al, 1999(Biere et al, , 2003Clarke et al, 2001) has profited from the developments in SAT solvers. This is done by limiting the length of the counterexamples one is searching for, which allows an efficient translation of the resulting problem to an instance of SAT.…”

Section: Model Checkingmentioning

confidence: 99%

Verification of behaviourist multi-agent systems by means of formally guided simulations

Silva¹

View full text Add to dashboard Cite

Bounded Model Checking

Cited by 659 publications

References 4 publications

Automated Route Planning for Milk-Run Transport Logistics with the NuSMV Model Checker

Automated Route Planning for Milk-Run Transport Logistics with the NuSMV Model Checker

Large-Scale Directed Model Checking LTL

Verification of behaviourist multi-agent systems by means of formally guided simulations

Contact Info

Product

Resources

About