Fairness
Automata-Theoretic techniques for modal logics of programs
Journal of Computer and System Sciences
On the complementation of Bu¨chi automata
Theoretical Computer Science
Improved upper and lower bounds for modal logics of programs
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
The complementation problem for Bu¨chi automata with applications to temporal logic
Theoretical Computer Science
On &ohgr;-automata and temporal logic
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
On the development of reactive systems
Logics and models of concurrent systems
Progress measures for complementation of &ohgr;-automata with applications to temporal logic
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Tree automata, Mu-Calculus and determinacy
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Progress measures and stack assertions for fair termination
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
On the power of bounded concurrency I: finite automata
Journal of the ACM (JACM)
Sequential synthesis using S1S
ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
Weak alternating automata and tree automata emptiness
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Theoretical Computer Science
Optimal Bounds for Transformations of omega-Automata
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Automata logics, and infinite games
Quantitative solution of omega-regular games
Journal of Computer and System Sciences - STOC 2001
From linear time to branching time
ACM Transactions on Computational Logic (TOCL)
Bridging the gap between fair simulation and trace inclusion
Information and Computation
An Incremental Technique for Automata-Based Decision Procedures
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Computing Convex Hulls by Automata Iteration
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
On-the-fly Emptiness Check of Transition-Based Streett Automata
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
Bridging the gap between fair simulation and trace inclusion
Information and Computation
The Büchi complementation saga
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
On (Omega-)regular model checking
ACM Transactions on Computational Logic (TOCL)
Reasoning about finite-state switched systems
HVC'09 Proceedings of the 5th international Haifa verification conference on Hardware and software: verification and testing
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Safraless compositional synthesis
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Complementation constructions for nondeterministic automata on infinite words
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Logic and model checking for hidden markov models
FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Strategy machines and their complexity
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Tight bounds for the determinisation and complementation of generalised Büchi automata
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
| Hi-index | 0.00 |
In [Saf88] an exponential determination procedure for Bu¨chi automata was shown, yielding tight bounds for decision procedures of some logics ([EJ88, Saf88, SV89, KT89]). In [SV89] the complexity of determinization and complementation of &ohgr;-automata was further investigated, leaving as an open question the complexity of the determinization of a single class of &ohgr;-automata. For this class of &ohgr;-automata with strong fairness as acceptance condition (Street automata), [SV89] managed to show an exponential complementation procedure, but showed that the blow-up of the translation of these automata to any of the classes known to admit exponential determinization is inherently exponential. This might suggest that the blow-up of the determinization of Street automata is inherently doubly exponential.Surprisingly, we show an exponential determinization construction for any Streett automaton. In fact, the complexity of our construction is roughly the same as the complexity achieved in [Saf88] for Bu¨chi automata. Moreover, a simple observation extends this upper bound to the complexity of the complementation problem. Since any &ohgr;-automaton that admits exponential determinization can be easily converted into a Streett automaton, we get one procedure that can be used for all of these conversions. This construction is optimal (up to a constant factor in the exponent) for all of these conversions.Our results imply that Streett automata (with strong fairness as acceptance condition) can be used instead of Bu¨chi automata (with the weaker acceptance condition) without any loss of efficiency.