In this paper a new model checking algorithm for quantitative temporal structures and quantitative temporal logic is presented, which avoids these drawbacks.
Abstract: The verification of real-time properties requires model checking techniques for quantitative temporal struc- tures and real-time temporal logics.
In this paper a new model checking algorithm for quantitative temporal structures and quantitative temporal logic is pre- sented, which avoids these drawbacks.
A new model checking algorithm for quantitative temporal structures and quantitative temporal logic is presented and motivated by low level circuit ...
In this paper a new model checking algorithm for quantitative temporal structures and quantitative temporal logic is presented, which avoids these drawbacks.
The verification of real-time properties requires model checking techniques for quantitative temporal structures and real-time temporal logics.
In this paper a new model checking algorithm for quantitative temporal structures and quantitative temporal logic is presented, which avoids these drawbacks.
This chapter introduces the basics of symbolic model checking. We first give the definition of Kripke structures, our model for finite-state transition graph.
People also ask
What is symbolic model checking?
Which is an efficient algorithm for polynomial evaluation?
The paper includes preliminary experimental results showing the effectiveness of our technique using both symbolic and bounded model checking tools. Read more.
We analyse the complexity of the presented model checking algorithm and furthermore present a fragment of the logic that can be efficiently checked.