Improved Multi-Core Nested Depth-First Search

Évangelista, Sami; Laarman, Alfons; Petrucci, Laure; Pol, Jaco van de

doi:10.1007/978-3-642-33386-6_22

Cited by 46 publications

(56 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The randomised successor function nextstate i however ensures that this does not happen for most practical inputs. Experiments on over 300 examples confirmed this [14,Sec. 4], making cndfs the current state-of-the-art parallel LTL model checking algorithm.…”

Section: Timed Nested Depth-first Search With Subsumptionmentioning

confidence: 55%

“…To evaluate the performance of the proposed algorithms experimentally, we implemented cndfs without [14] and with subsumption (Alg. 3) in LTSmin 2.0 3 .…”

Section: Experimental Evaluationmentioning

confidence: 99%

“…To test their onthe-fly nature, we also tried a few incorrect LTL formula for the above models, to which the algorithms all delivered counter examples within a second. But with parallelism this happens almost instantly [14,Sec. 4.2].…”

Section: Experimental Evaluationmentioning

confidence: 99%

“…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. 4.3].…”

Section: Introductionmentioning

confidence: 99%

“…4.3]. The latest version, called cndfs, combines all these qualities and decreases memory usage [14].…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

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

Laarman

Olesen

Dalsgaard

et al. 2013

Computer Aided Verification

Self Cite

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

Section: Timed Nested Depth-first Search With Subsumptionmentioning

confidence: 55%

“…To evaluate the performance of the proposed algorithms experimentally, we implemented cndfs without [14] and with subsumption (Alg. 3) in LTSmin 2.0 3 .…”

Section: Experimental Evaluationmentioning

confidence: 99%

Section: Experimental Evaluationmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

“…4.3]. The latest version, called cndfs, combines all these qualities and decreases memory usage [14].…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

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

Laarman

Olesen

Dalsgaard

et al. 2013

Computer Aided Verification

Self Cite

View full text Add to dashboard Cite

show abstract

Swarm Model Checking on the GPU

DeFrancisco

Cho

Ferdman

et al. 2019

Model Checking Software

View full text Add to dashboard Cite

Combining Parallel Emptiness Checks with Partial Order Reductions

Poitrenaud

Renault

2019

Formal Methods and Software Engineering

View full text Add to dashboard Cite

In explicit state model checking of concurrent systems, multicore emptiness checks and partial order reductions (POR) are two major techniques to handle large state spaces. The first one tries to take advantage of multi-core architectures while the second one may decrease exponentially the size of the state space to explore. For checking LTL properties, Bloemen and van de Pol [2] shown that the best performance is currently obtained using their multi-core SCC-based emptiness check. However, combining the latest SCC-based algorithm with POR is not trivial since a condition on cycles, the proviso, must be enforced on an algorithm which processes collaboratively cycles. In this paper, we suggest a pessimistic approach to tackle this problem for liveness properties. For safety ones, we propose an algorithm which takes benefit from the information computed by the SCC-based algorithm. We also present new parallel provisos for both safety and liveness properties that relies on other multi-core emptiness checks. We observe that all presented algorithms maintain good reductions and scalability.

show abstract

Improved Multi-Core Nested Depth-First Search

Cited by 46 publications

References 22 publications

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

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

Swarm Model Checking on the GPU

Combining Parallel Emptiness Checks with Partial Order Reductions

Contact Info

Product

Resources

About