Parallel Saturation Based Model Checking

Voros, Andr ́s; Szabo, Tam ́s; ́mbor, Attila J; Darvas, Dániel; ́th, Akos Horv; Bartha, Tamás

doi:10.1109/ispdc.2011.23

Cited by 4 publications

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Multi-core On-The-Fly Saturation

Dijk

Meijer

Pol

2019

Tools and Algorithms for the Construction and Analysis of Systems

View full text Add to dashboard Cite

Saturation is an efficient exploration order for computing the set of reachable states symbolically. Attempts to parallelize saturation have so far resulted in limited speedup. We demonstrate for the first time that on-the-fly symbolic saturation can be successfully parallelized at a large scale. To this end, we implemented saturation in Sylvan's multicore decision diagrams used by the LTSmin model checker. We report extensive experiments, measuring the speedup of parallel symbolic saturation on a 48-core machine, and compare it with the speedup of parallel symbolic BFS and chaining. We find that the parallel scalability varies from quite modest to excellent. We also compared the speedup of on-the-fly saturation and saturation for pre-learned transition relations. Finally, we compared our implementation of saturation with the existing sequential implementation based on Meddly. The empirical evaluation uses Petri nets from the model checking contest, but thanks to the architecture of LTSmin, parallel on-the-fly saturation is now available to multiple specification languages. Data or code related to this paper is available at: [34].

show abstract

Multi-core On-The-Fly Saturation

Dijk

Meijer

Pol

2019

Tools and Algorithms for the Construction and Analysis of Systems

View full text Add to dashboard Cite

show abstract

Extensions to the CEGAR Approach on Petri Nets

Hajdu¹,

Vörös²,

Bartha³

et al. 2014

Acta Cybern

View full text Add to dashboard Cite

Abstract. Formal verification is becoming more prevalent and often compulsory in the safety-critical system and software development processes. Reachability analysis can provide information about safety and invariant properties of the developed system. However, checking the reachability is a computationally hard problem, especially in the case of asynchronous or infinite state systems. Petri nets are widely used for the modeling and verification of such systems. In this paper we examine a recently published approach for the reachability checking of Petri net markings. We give proofs concerning the completeness and the correctness properties of the algorithm, and we introduce algorithmic improvements. We also extend the algorithm to handle new classes of problems: submarking coverability and reachability of Petri nets with inhibitor arcs.

show abstract

Bounded saturation-based CTL model checking

Vörös¹,

Darvas²,

Bartha³

2013

Proc. Estonian Acad. Sci.

View full text Add to dashboard Cite

Abstract. Formal verification is becoming a fundamental step of safety-critical and model-based software development. As part of the verification process, model checking is one of the current advanced techniques to analyse the behaviour of a system. Symbolic model checking is an efficient approach to handling even complex models with huge state spaces. Saturation is a symbolic algorithm with a special iteration strategy, which is efficient for asynchronous models. Recent advances have resulted in many new kinds of saturation-based algorithms for state space generation and bounded state space generation and also for structural model checking. In this paper, we examine how the combination of two advanced model checking algorithms -bounded saturation and saturationbased structural model checking -can be used to verify systems. Our work is the first attempt to combine these approaches, and this way we are able to handle and examine complex or even infinite state systems. Our measurements show that we can exploit the efficiency of saturation in bounded model checking.

show abstract

Parallel Saturation Based Model Checking

Cited by 4 publications

References 19 publications

Multi-core On-The-Fly Saturation

Multi-core On-The-Fly Saturation

Extensions to the CEGAR Approach on Petri Nets

Bounded saturation-based CTL model checking

Contact Info

Product

Resources

About