Parallel Nested Depth-First Searches for LTL Model Checking

Évangelista, Sami; Petrucci, Laure; Youcef, Samir

doi:10.1007/978-3-642-24372-1_27

Cited by 21 publications

(29 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Since the blue flags are not shared among threads, the red searches are still invoked in the appropriate DFS postorder. The ENDFS algorithm [10] also allows the sharing of blue flags, but a sequential emergency procedure is triggered if the appropriate invocation order of the red DFS is not respected. Moreover, to maintain correctness, information on a red DFS in progress cannot be transmitted in "real time" to other threads: the states visited by a red DFS are only marked globally red after it has returned.…”

Section: Parallel Ltl Model Checking Algorithms For Shared-memory Arcmentioning

confidence: 99%

“…This is absolutely necessary since the number of blue states (all reachable states) typically exceeds the number of red states (visited by the red DFS). In ENDFS, however, sharing the blue colour often led to the expensive (memory and performance wise) sequential repair procedure [10]. We were unable to construct a correct algorithm that colours both blue and red while backtracking from the respective DFS procedures.…”

mentioning

confidence: 92%

“…We compare our approach to the best representative of that family. More recently, two algorithms (LNDFS from [13] and ENDFS from [10]) adapted the well known Nested DFS (NDFS) algorithm [8] to multi-core architectures. They share the principle of launching multiple instances of NDFS that synchronise themselves to avoid useless state revisits.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Improved Multi-Core Nested Depth-First Search

Évangelista

Laarman

Petrucci

et al. 2012

Automated Technology for Verification and Analysis

Self Cite

View full text Add to dashboard Cite

Abstract. This paper presents CNDFS, a tight integration of two earlier multicore nested depth-first search (NDFS) algorithms for LTL model checking. CNDFS combines the different strengths and avoids some weaknesses of its predecessors. We compare CNDFS to an earlier ad-hoc combination of those two algorithms and show several benefits: It has shorter and simpler code and a simpler correctness proof. It exhibits more robust performance with similar scalability, while at the same time reducing memory requirements. The algorithm has been implemented in the multi-core backend of the LTSMIN model checker, which is now benchmarked for the first time on a 48 core machine (previously 16). The experiments demonstrate better scalability than other parallel LTL model checking algorithms, but we also investigate apparent bottlenecks. Finally, we noticed that the multi-core NDFS algorithms produce shorter counterexamples, surprisingly often shorter than their BFS-based counterparts.

show abstract

Section: Parallel Ltl Model Checking Algorithms For Shared-memory Arcmentioning

confidence: 99%

mentioning

confidence: 92%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Improved Multi-Core Nested Depth-First Search

Évangelista

Laarman

Petrucci

et al. 2012

Automated Technology for Verification and Analysis

Self Cite

View full text Add to dashboard Cite

show abstract

“…Recently, some multi-core version of these algorithms were introduced by Evangelista and Laarman et al [17,15,14]. These algorithms have the following properties: their runtime is linear in the number of states in the worst case while typically yielding good scalability; they are on-the-fly [18] and yield short counter examples [14,Sec.…”

Section: Introductionmentioning

confidence: 99%

Multi-core Emptiness Checking of Timed Büchi Automata Using Inclusion Abstraction

Laarman

Olesen

Dalsgaard

et al. 2013

Computer Aided Verification

View full text Add to dashboard Cite

Abstract. This paper contributes to the multi-core model checking of timed automata (TA) with respect to liveness properties, by investigating checking of TA Büchi emptiness under the very coarse inclusion abstraction or zone subsumption, an open problem in this field. We show that in general Büchi emptiness is not preserved under this abstraction, but some other structural properties are preserved. Based on those, we propose a variation of the classical nested depth-first search (ndfs) algorithm that exploits subsumption. In addition, we extend the multi-core cndfs algorithm with subsumption, providing the first parallel LTL model checking algorithm for timed automata. The algorithms are implemented in LTSmin, and experimental evaluations show the effectiveness and scalability of both contributions: subsumption halves the number of states in the real-world FDDI case study, and the multi-core algorithm yields speedups of up to 40 using 48 cores.

show abstract

“…We have extracted the graphs of τ -transitions for all implementation processes in the FDR3 test suite (including most of the CSP models from [15,16,1]) and the CSP models from [10]. The top of Figure 4 gives statistics about a selection of the graphs with between 200,000 and 5,000,000 states (we omit eleven such, in the interests of space), plus a slightly smaller file tring2.1 which we discuss below 4 . For each graph we give the number of states (i.e.…”

Section: Methodsmentioning

confidence: 99%