Accepting Predecessors Are Better than Back Edges in Distributed LTL Model-Checking

Brim, Luboš; Černá, Ivana; Moravec, Pavel; Šimša, Jiří

doi:10.1007/978-3-540-30494-4_25

Cited by 54 publications

(63 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…[MAP] The main idea of the Maximal Accepting Predecessor Algorithm [14,16] is based on the fact that every accepting vertex lying on an accepting cycle is its own predecessor. An algorithm that is directly derived from the idea, would require expensive computation as well as space to store all proper accepting predecessors of all (accepting) vertices.…”

Section: Parallel Ltl Model-checking Algorithmsmentioning

confidence: 99%

Scalable shared memory LTL model checking

Barnat

Brim

Ročkai

2010

Int J Softw Tools Technol Transfer

View full text Add to dashboard Cite

Abstract. Recent development in computer hardware has brought more wide-spread emergence of shared memory, multi-core systems. These architectures offer opportunities to speed up various tasks -model checking and reachability analysis among others. In this paper, we present a design for a parallel shared memory LTL model checker that is based on a distributed memory algorithm. To improve the scalability of our tool, we have devised a number of implementation techniques which we present in this paper. We also report on a number of experiments we conoducted to analyze the behaviour of our tool under different conditions using various models. We demonstrate that our tool exhibits significant speedup in comparison to sequential tools, which improves the workflow of verification in general.

show abstract

Section: Parallel Ltl Model-checking Algorithmsmentioning

confidence: 99%

Scalable shared memory LTL model checking

Barnat

Brim

Ročkai

2010

Int J Softw Tools Technol Transfer

View full text Add to dashboard Cite

show abstract

“…A line of research tries to avoid nested depth-first search by studying variants of breadth-first search [5,4,7]. The approach presented in [5,4] invokes a secondary search for detecting cycles from BFS backward edges, i.e., transitions encountered in the overall state space that link states in larger, together with (already explored) states in smaller depth.…”

Section: Breadth-first Ltl Model Checkingmentioning

confidence: 99%

“…The approach allows on-the-fly model checking and is compatible with a limited form of partial order reduction. In [7], instead of backward edges, predecessor acceptance is chosen for an O(|R| 2 + |S|) algorithm.…”

Section: Breadth-first Ltl Model Checkingmentioning

confidence: 99%

“…The main challenge for distributed and external on-the-fly model checking is that the depth-first traversal of the global state space graph as used in Nested-DFS (an on-the-fly variant of Tarjan's algorithm [35]) is not efficient. All attempts to solve this problem via variants of breadth-first search [7,4,9] arrive at a time complexity that is non-linear in the size of the model. The approach we propose in this paper is based on a translation procedure of liveness problems into safety problems [32].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

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

“…[MAP] The main idea of the Maximal Accepting Predecessor Algorithm [4,6] is based on the fact that every accepting vertex lying on an accepting cycle is its own predecessor. An algorithm that is directly derived from the idea, would require expensive computation as well as space to store all proper accepting predecessors of all (accepting) vertices.…”

Section: Parallel Ltl Model-checking Algorithmsmentioning

confidence: 99%

Scalable Multi-core LTL Model-Checking

Barnat

Brim

Ročkai

Model Checking Software

Self Cite

View full text Add to dashboard Cite

Abstract. Recent development in computer hardware has brought more wide-spread emergence of shared-memory, multi-core systems. These architectures offer opportunities to speed up various tasks -among others LTL model checking. In the paper we show a design for a parallel sharedmemory LTL model checker, that is based on a distributed-memory algorithm. To achieve good scalability, we have devised and experimentally evaluated several implementation techniques, which we present in the paper.

show abstract

Accepting Predecessors Are Better than Back Edges in Distributed LTL Model-Checking

Cited by 54 publications

References 12 publications

Scalable shared memory LTL model checking

Scalable shared memory LTL model checking

Large-Scale Directed Model Checking LTL

Scalable Multi-core LTL Model-Checking

Contact Info

Product

Resources

About