Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Applications of temporal logic to the specification of real time systems (extended abstract)
Proceedings of a Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Verification of synchronous sequential machines based on symbolic execution
Proceedings of the international workshop on Automatic verification methods for finite state systems
Specifying real-time properties with metric temporal logic
Real-Time Systems
Quantitative temporal reasoning
Real-Time Systems
Real-time symbolic model checking for discrete time models
Theories and experiences for real-time system development
Symbolic Model Checking
Deciding Properties of Timed Transition Models
IEEE Transactions on Parallel and Distributed Systems
Verifying real-time properties of MOS-transistor circuits
EDTC '95 Proceedings of the 1995 European conference on Design and Test
Computing timed transition relations for sequential cycle-based simulation
DATE '99 Proceedings of the conference on Design, automation and test in Europe
Symbolic Verification and Analysis of Discrete Timed Systems
Formal Methods in System Design
A tutorial introduction to symbolic model checking
Logic for concurrency and synchronisation
Hi-index | 0.00 |
The verification of real-time properties requires model checking techniques for quantitative temporal structures and real-time temporal logics. However, up to now, most of those problems were solved by a translation into a standard CTL model checking problem with unit-delay structures. Although usual CTL model checkers like SMV can be used then, the translation leads to large structures and CTL formulas, such that the verification requires large computation times and only small circuits can be verified. In this paper a new model checking algorithm for quantitative temporal structures and quantitative temporal logic is presented, which avoids these drawbacks. Motivated by low-level circuit verification, the implemented prover can be used for verifying general real-time systems. Although it has been proved that the complexity of the new algorithm is identical to the corresponding CTL model checking problem, the application of the new algorithms leads to significant better runtimes and larger verifiable structures. The paper presents the underlying algorithms, the complexity proof, implementational issues and concludes with experimental results, demonstrating the advantages of our approach.