Theoretical Computer Science
From Timed Automata to Logic - and Back
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
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)
Results on the Propositional µ-Calculus
Proceedings of the 9th Colloquium on Automata, Languages and Programming
Automata For Modeling Real-Time Systems
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Model Checking via Reachability Testing for Timed Automata
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
A Compositional Proof of a Real-Time Mutual Exclusion Protocol
TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Compositional Verification of Probabilistic Processes
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Compositional Model Checking of Real Time Systems
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
The Power of Reachability Testing for Timed Automata
Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science
Model-Checking for Hybrid Systems by Quotienting and Constraints Solving
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
This paper gives a survey of a composition model checking methodology and its succesfull instantiation to the model checking of networks of finite-state, timed, hybrid and probabilistic systems with respect to suitable quantitative versions of the modal μ-calculus [Koz82]. The method is based on the existence of a quotient construction, allowing a property φ of a parallel system A|B to be transformed into a sufficient and necessary quotient-property φ/ A to be satisfied by the component B. Given a model checking problem involving a network P1|...|Pn and a property φ, the method gradually move (by quotienting) components Pi from the network into the formula φ. Crucial to the success of the method is the ability to manage the size of the intermediate quotient-properties by a suitable collection of efficient minimization heuristics.