Tableau-based model checking in the propositional mu-calculus
Acta Informatica
Tree automata, Mu-Calculus and determinacy
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Reasoning about infinite computations
Information and Computation
Fast and simple nested fixpoints
Information Processing Letters
An improved algorithm for the evaluation of fixpoint expressions
Theoretical Computer Science
Fixed point characterization of infinite behavior of finite-state systems
Theoretical Computer Science
Weak alternating automata and tree automata emptiness
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
A Hierarchy Theorem for the µ-Calculus
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Practical Model-Checking Using Games
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Monadic Second Order Logic on Tree-Like Structures
STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
Simplifying the Modal Mu-Calculus Alternation Hierarchy
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
Local Model Checking Games for Fixed Point Logic with Chop
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
The Modal mu-calculus Alternation Hierarchy is Strict
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Model Checking Fixed Point Logic with Chop
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
A modal fixpoint logic with chop
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
| Hi-index | 0.00 |
Fixpoint logic with chop extends the modal µ-calculus with a sequential composition operator which results in an increase in expressive power. We develop a game-theoretic characterisation of its model checking problem and use these games to show that the alternation hierarchy in this logic is strict. The structure of this result follows the lines of Arnold's proof showing that the alternation hierarchy in the modal µ-calculus is strict over the class of binary trees.