Weak alternating automata and tree automata emptiness
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Constructing automata from temporal logic formulas: a tutorial
Lectures on formal methods and performance analysis
Model Checking of Safety Properties
Formal Methods in System Design
Representing Arithmetic Constraints with Finite Automata: An Overview
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
Symbolic Strategy Synthesis for Games on Pushdown Graphs
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Model Checking: A Tutorial Overview
MOVEP '00 Proceedings of the 4th Summer School on Modeling and Verification of Parallel Processes
Branching vs. Linear Time: Final Showdown
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Weak Alternating Automata in Isabelle/HOL
TPHOLs '00 Proceedings of the 13th International Conference on Theorem Proving in Higher Order Logics
Extended Temporal Logic Revisited
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Alternating Automata and Logics over Infinite Words
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Model Checking of Safety Properties
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Fast LTL to Büchi Automata Translation
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Language Containment Checking with Nondeterministic BDDs
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Probabilistic Linear-Time Model Checking: An Overview of the Automata-Theoretic Approach
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
On the Use of Weak Automata for Deciding Linear Arithmetic with Integer and Real Variables
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
From bidirectionality to alternation
Theoretical Computer Science - Mathematical foundations of computer science
Model checking: a tutorial overview
Modeling and verification of parallel processes
Automata logics, and infinite games
An effective decision procedure for linear arithmetic over the integers and reals
ACM Transactions on Computational Logic (TOCL)
Assert and negate revisited: modal semantics for UML sequence diagrams
Proceedings of the 2006 international workshop on Scenarios and state machines: models, algorithms, and tools
Trio2Promela: A Model Checker for Temporal Metric Specifications
ICSE COMPANION '07 Companion to the proceedings of the 29th International Conference on Software Engineering
The Büchi complementation saga
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Improved algorithms for the automata-based approach to model-checking
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
The weakness of self-complementation
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
Concepts of automata construction from LTL
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Survey: Linear Temporal Logic Symbolic Model Checking
Computer Science Review
Hi-index | 0.00 |
Automata on infinite words are used for specification and verification of nonterminating programs. Different types of automata induce different levels of expressive power, of succinctness, and of complexity. Alternating automata have both existential and universal branching modes and are particularly suitable for specification of programs. In a {\em weak alternating automaton}, the state space is partitioned into partially ordered sets, and the automaton can proceed from a certain set only to smaller sets. Reasoning about weak alternating automata is easier than reasoning about alternating automata with no restricted structure. Known translations of alternating automata to weak alternating automata involve determinization, and therefore involve a double-exponential blow-up. In this paper we describe a quadratic translation, which circumvents the need for determinization, of Buchi and co-Buchi alternating automata to weak alternating automata. Beyond the independent interest of such a translation, it gives rise to a simple complementation algorithm for nondeterministic Buchi automata.