Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Alternating automata, the weak monadic theory of the tree, and its complexity
International Colloquium on Automata, Languages and Programming on Automata, languages and programming
Alternating automata on infinite trees
Theoretical Computer Science
A linear algorithm to solve fixed-point equations on transition systems
Information Processing Letters
Handbook of theoretical computer science (vol. B)
Symbolic model checking: 1020 states and beyond
Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
Reasoning about infinite computations
Information and Computation
Computer-aided verification of coordinating processes: the automata-theoretic approach
Computer-aided verification of coordinating processes: the automata-theoretic approach
An automata-theoretic approach to linear temporal logic
Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata
Weak alternating automata and tree automata emptiness
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
Symbolic Model Checking
MONA 1.x: New Techniques for WS1S and WS2S
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
A Linear-Time Model-Checking Algorithm for the Alternation-Free Modal Mu-Calculus
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
An Automata-Theoretic Approach to Branching-Time Model Checking (Extended Abstract)
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Mona & Fido: The Logic-Automaton Connection in Practice
CSL '97 Selected Papers from the11th International Workshop on Computer Science Logic
Verification Tools for Finite-State Concurrent Systems
A Decade of Concurrency, Reflections and Perspectives, REX School/Symposium
Freedom, Weakness, and Determinism: From Linear-Time to Branching-Time
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Weak Alternating Automata Are Not That Weak
ISTCS '97 Proceedings of the Fifth Israel Symposium on the Theory of Computing Systems (ISTCS '97)
Weak alternating automata are not that weak
ACM Transactions on Computational Logic (TOCL)
Automata logics, and infinite games
Comparing XML path expressions
Proceedings of the 2006 ACM symposium on Document engineering
A system for the static analysis of XPath
ACM Transactions on Information Systems (TOIS)
Ambiguous classes in µ-calculi hierarchies
Theoretical Computer Science - Foundations of software science and computation structures
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Hi-index | 0.00 |
Model checking is a method for the verification of systems with respect to their specifications. Symbolic model-checking, which enables the verification of large systems, proceeds by evaluating fixed-point expressions over the system's set of states. Such evaluation is particularly simple and efficient when the expressions do not contain alternation between least and greatest fixed-point operators; namely, when they belong to the alternation-free µ-calculus (AFMC). Not all specifications, however, can be translated to AFMC, which is exactly as expressive as weak monadic second-order logic (WS2S). Rabin showed that a set τ of trees can be expressed inWS2S if and only if both τ and its complement can be recognized by nondeterministic Büchi tree automata. For the "only if" direction, Rabin constructed, given two nondeterministic Büchi tree automata u and u′ that recognize τ and its complement, a WS2S formula that is satisfied by exactly all trees in τ . Since the translation of WS2S to AFMC is nonelementary, this construction is not practical. Arnold and Niwinski improved Rabin's construction by a direct translation of u and u′ to AFMC, which involves a doubly-exponential blowup and is therefore still impractical. In this paper we describe an alternative and quadratic translation of u and u′ to AFMC. Our translation goes through weak alternating tree automata, and constitutes a step towards efficient symbolic model checking of highly expressive specification formalisms.