CMC: A Tool for Compositional Model-Checking of Real-Time Systems
FORTE XI / PSTV XVIII '98 Proceedings of the FIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XI) and Protocol Specification, Testing and Verification (PSTV XVIII)
Partition Refinement in Real-Time Model Checking
FTRTFT '98 Proceedings of the 5th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Graphical Specification and Reasoning: Case Study Generalised Railroad Crossing
FME '97 Proceedings of the 4th International Symposium of Formal Methods Europe on Industrial Applications and Strengthened Foundations of Formal Methods
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Parametric model checking with verICS
Transactions on Petri nets and other models of concurrency IV
Bounded model checking for parametric timed automata
Transactions on Petri Nets and Other Models of Concurrency V
| Hi-index | 0.00 |
We define an operational subset of Duration Calculus, called phase automata, which serves as an intermediate language for the analysis and verification of real-time system descriptions that contain timing parameters.We introduce the tool MOBY/DC which implements a model-checking algorithm for phase automata. The algorithm applies compositional model-checking techniques and handles parameters by built-in procedures or by a link to CLP(R). Due to the parameters the model-checking problem is undecidable in general. Hence, we have to accept that the results are overapproximations only in order to guarantee termination. The overapproximation together with the compositional technique makes the model-checker especially well suited for proving the absence of error traces instead of finding them.