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 analyze the behavior 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 saturation-based 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.
Highlights
Formal methods are becoming widely used for the verification of safety-critical and embedded systems
The saturation-based Computation Tree Logic (CTL) model checking algorithm is executed on the bounded state space representation Multiple-valued Decision Diagram (MDD)
Our main purpose was to examine the efficiency of our algorithm and compare it to the classical algorithms of CTL model checking
Summary
Formal methods are becoming widely used for the verification of safety-critical and embedded systems. Instead of storing states explicitly, symbolic techniques rely on an encoded representation of the state space such as decision diagrams. These are compact graph forms of discrete functions. Bounded model checking is an advanced technique to handle these problems, as it explores and examines the properties on a bounded part of the state space. First attempt to combine saturation-based CTL model checking and bounded saturation-based state space exploration. Our work is a first step towards efficient bounded CTL model checking with many directions to be explored in the future. We summarize the related work and give our conclusions and directions for future work
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
