Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
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
Computer-aided verification of coordinating processes: the automata-theoretic approach
Computer-aided verification of coordinating processes: the automata-theoretic approach
Deciding the winner in parity games is in UP ∩ co-UP
Information Processing Letters
Automata for the Modal mu-Calculus and related Results
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
Faster Algorithms for the Nonemptiness of Streett Automata and for Communication Protocol Pruning
SWAT '96 Proceedings of the 5th Scandinavian Workshop on Algorithm Theory
An Algorithm for Strongly Connected Component Analysis in n log n Symbolic Steps
FMCAD '00 Proceedings of the Third International Conference on Formal Methods in Computer-Aided Design
The complexity of tree automata and logics of programs
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Theories of automata on ω-tapes: A simplified approach
Journal of Computer and System Sciences
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
25 Years of Model Checking
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Environment Assumptions for Synthesis
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Better Quality in Synthesis through Quantitative Objectives
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
State of büchi complementation
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
A sub-quadratic algorithm for conjunctive and disjunctive boolean equation systems
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
Games and markov decision processes with mean-payoff parity and energy parity objectives
MEMICS'11 Proceedings of the 7th international conference on Mathematical and Engineering Methods in Computer Science
Proof graphs for parameterised boolean equation systems
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
| Hi-index | 0.00 |
Different types of nondeterministic automata on infinite words differ in their succinctness and in the complexity for their nonemptiness problem. A simple translation of a parity automaton to an equivalent Büchi automaton is quadratic: a parity automaton with n states, m transitions, and index k may result in a Büchi automaton of size O((n + m)k). The best known algorithm for the nonemptiness problem of parity automata goes through Büchi automata, leading to a complexity of O((n + m)k). In this paper we show that while the translation of parity automata to Büchi automata cannot be improved, the special structure of the acceptance condition of parity automata can be used in order to solve the nonemptiness problem directly, with a dynamic graph algorithm of complexity O((n + m) log k).