Automata-Theoretic techniques for modal logics of programs
Journal of Computer and System Sciences
Model checking
An automata-theoretic approach to branching-time model checking
Journal of the ACM (JACM)
Information and Computation - Special issue on FLOC '96
Model checking of hierarchical state machines
ACM Transactions on Programming Languages and Systems (TOPLAS)
Reasoning about The Past with Two-Way Automata
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Specification and verification of concurrent systems in CESAR
Proceedings of the 5th Colloquium on International Symposium on Programming
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
Analysis of recursive state machines
ACM Transactions on Programming Languages and Systems (TOPLAS)
Verification of scope-dependent hierarchical state machines
Information and Computation
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Pushdown module checking with imperfect information
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Improved model checking of hierarchical systems
Information and Computation
Improved model checking of hierarchical systems
VMCAI'10 Proceedings of the 11th international conference on Verification, Model Checking, and Abstract Interpretation
Automata-theoretic decision of timed games
Theoretical Computer Science
Hi-index | 0.01 |
Module checking is a well investigated technique for verifying the correctness of open systems, which are systems characterized by an ongoing interaction with an external environment. In the classical module checking framework, in order to check whether an open system satisfies a required property, we first translate the entire system into an open model (module ) that collects all possible behaviors of the environment and then check it with respect to a formal specification of the property. Recently, in the case of closed system, Alur and Yannakakis have considered hierarchical structure models in order to have models exponentially more succinct. A hierarchical model uses as nodes both ordinary nodes and supernodes, which are hierarchical models themselves. For CTL specifications, it has been shown that for the simple case of models having only single-exit supernodes, the hierarchical model checking problem is not harder than the classical one. On the contrary, for the more general multiple-exit case, the problem becomes Pspace -complete. In this paper, we investigate the program complexity of the CTL hierarchical module checking problem , that is, we consider the module checking problem for a fixed CTL formula and modules having also supernodes that are modules themselves. By exploiting an automata-theoretic approach through the introduction of hierarchical Büchi tree automata, we show that, in the single-exit case, the addressed problem remains in Ptime , while in the multiple-exit case, it becomes Pspace -complete.