Communicating sequential processes
Communicating sequential processes
On the development of reactive systems
Logics and models of concurrent systems
Model checking
Information and Computation - Special issue on FLOC '96
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
The Complexity of the Graded µ-Calculus
CADE-18 Proceedings of the 18th International Conference on Automated Deduction
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Modal μ-calculus and alternating tree automata
Automata logics, and infinite games
On the undecidability of logics with converse, nominals, recursion and counting
Artificial Intelligence
The complexity of enriched µ-calculi
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Enriched µ-calculus pushdown module checking
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Pushdown module checking with imperfect information
Information and Computation
| Hi-index | 0.00 |
The model checking problem for open finite-state systems (called module checking) has been intensively studied in the literature with respect to CTL and CTL*. In this paper, we focus on module checking with respect to the fully enriched µ-calculus and some of its fragments. Fully enriched µ-calculus is the extension of the propositional µ-calculus with inverse programs, graded modalities, and nominals. The fragments we consider here are obtained by dropping at least one of the additional constructs. For the full calculus, we show that module checking is undecidable by using a reduction from the domino problem. For its fragments, instead, we show that module checking is decidable and EXPTIME-complete. This result is obtained by using, for the upper bound, a classical automata-theoretic approach via Forest Enriched Automata and, for the lower bound, a reduction from the module checking problem for CTL, known to be EXPTIME-hard.