Improving Saturation-based Bounded Model Checking

Abstract

Formal verification is becoming a fundamental step in assuring the correctness of safety-critical systems. Since these systems are often asynchronous and even distributed, their verification requires methods that can deal with huge or even infinite state spaces. Model checking is one of the current techniques to analyse the behaviour of systems, as part of the verification process.In this paper a symbolic bounded model checking algorithm is presented that relies on efficient saturation-based methods. The previous approaches are extended with new bounded state space exploration strategies. In addition, constrained saturation is also introduced to improve the efficiency of bounded model checking. Our measurements confirm that these approaches do not only offer a solution to deal with infinite state spaces, but in many cases they even outperform the original methods.

Industrial applications of the PetriDotNet modelling and analysis tool

“…• Bounded CTL model checking based on a novel saturation-based algorithm, with various search strategies [26,27]. This required the integration of the bounded state space exploration [24] with the CTL model checking algorithms.…”

“…This required the integration of the bounded state space exploration [24] with the CTL model checking algorithms. Further improvements were done in order to reduce the performance overhead of the bounded saturation [27].…”

PetriDotNet 1.5: Extensible Petri Net Editor and Analyser for Education and Research

“…-CTL model checking of ordinary and coloured Petri nets based on traditional and extended versions of saturation [1,25], -Bounded CTL model checking based on a novel saturation-based algorithm, with various search strategies [10,24], -LTL model checking based on a novel synchronous product computation algorithm [20] and incremental SCC detection [19].…”