opaal: A Lattice Model Checker

Dalsgaard, Andreas Engelbredt; Hansen, René Rydhof; Jørgensen, Kenneth Yrke; Larsen, Kim G.; Olesen, Mads Chr.; Olsen, Petur; Srba, Jǐŕı

doi:10.1007/978-3-642-20398-5_37

Cited by 12 publications

(15 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…3) in LTSmin 2.0 3 . The opaal [10] tool 4 functions as a front-end for uppaal models. Previously, we demonstrated scalable multi-core reachability for timed automata [11].…”

Section: Experimental Evaluationmentioning

confidence: 99%

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

“…3) in LTSmin 2.0 3 . The opaal [10] tool 4 functions as a front-end for uppaal models. Previously, we demonstrated scalable multi-core reachability for timed automata [11].…”

Section: Experimental Evaluationmentioning

confidence: 99%

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

“…It is rather the number of branches that need to be exercised, along with the number of tasks, that determines the limitations as the size of the UPPAAL model grows exponentially with the number of components in the NTA. However, since schedulability is viewed as a reachability problem, it may be possible to translate it into the subset of the UPPAAL modeling language supported by the opaal+LTSmin system [51]. In [52], opaal+LTSmin demonstrates a speedup of 40 on a 48 core machine compared to UPPAAL.…”

Section: Resultsmentioning

confidence: 99%

Symbolic execution and timed automata model checking for timing analysis of Java real-time systems

2015

View full text Add to dashboard Cite

This paper presents SYMRT, a tool based on a combination of symbolic execution and real-time model checking for timing analysis of Java systems. Symbolic execution is used for the generation of a safe and tight timing model of the analyzed system capturing the feasible execution paths. The model is combined with suitable execution environment models capturing the timing behavior of the target host platform including the Java virtual machine and complex hardware features such as caching. The complete timing model is a network of timed automata which directly facilitates safe estimates of worst and best case execution time to be determined using the UPPAAL model checker. Furthermore, the integration of the proposed techniques into the TETASARTS tool facilitates reasoning about additional timing properties such as the schedulability of periodically and sporadically released Java real-time tasks (under specific scheduling policies), worst case response time, and more.

show abstract

“…Remark that part of the ordering is compared using discrete equality (the location vector), while only a subpart is compared using a well-quasi-ordering. Without loss of generality, and as done in [17], we can split the state into an explicit part S, and a symbolic part Σ, s.t. the well-structured transition system is defined over S × Σ.…”

Section: Definition 3 (Timed Automatonmentioning

confidence: 99%

“…Previously, the opaal tool was used to generate Python code [17], but important parts of its infrastructure, e.g., analysing the model to find max clock constants [8], can be reused. In Sec.…”

Section: A Multi-core Timed Reachability Toolmentioning

confidence: 99%

See 1 more Smart Citation

Multi-core Reachability for Timed Automata

Dalsgaard

Laarman

Larsen

et al. 2012

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. Model checking of timed automata is a widely used technique. But in order to take advantage of modern hardware, the algorithms need to be parallelized. We present a multi-core reachability algorithm for the more general class of well-structured transition systems, and an implementation for timed automata. Our implementation extends the opaal tool to generate a timed automaton successor generator in c++, that is efficient enough to compete with the uppaal model checker, and can be used by the discrete model checker LTSmin, whose parallel reachability algorithms are now extended to handle subsumption of semi-symbolic states. The reuse of efficient lockless data structures guarantees high scalability and efficient memory use. With experiments we show that opaal+LTSmin can outperform the current state-of-the-art, uppaal. The added parallelism is shown to reduce verification times from minutes to mere seconds with speedups of up to 40 on a 48-core machine. Finally, strict BFS and (surprisingly) parallel DFS search order are shown to reduce the state count, and improve speedups.

show abstract

opaal: A Lattice Model Checker

Cited by 12 publications

References 10 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

Symbolic execution and timed automata model checking for timing analysis of Java real-time systems

Multi-core Reachability for Timed Automata

Contact Info

Product

Resources

About