Supervisory control of a class of discrete event processes
SIAM Journal on Control and Optimization
On the synthesis of a reactive module
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Languages, automata, and logic
Handbook of formal languages, vol. 3
ACM Transactions on Programming Languages and Systems (TOPLAS)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Finitary winning in ω-regular games
ACM Transactions on Computational Logic (TOCL)
Theories of automata on ω-tapes: A simplified approach
Journal of Computer and System Sciences
On the topological complexity of MSO+U and related automata models
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
| Hi-index | 0.00 |
The class of ω-regular languages provides a robust specification language in verification. Every ω-regular condition can be decomposed into a safety part and a liveness part. The liveness part ensures that something good happens "eventually". Finitary liveness was proposed by Alur and Henzinger as a stronger formulation of liveness [2]. It requires that there exists an unknown, fixed bound b such that something good happens within b transitions. In this work we consider automata with finitary acceptance conditions defined by finitary Büchi, parity and Streett languages. We give their topological complexity of acceptance conditions, and present a regular-expression characterization of the languages they express. We provide a classification of finitary and classical automata with respect to the expressive power, and give optimal algorithms for classical decisions questions on finitary automata.We (a) show that the finitary languages are Σ20-complete; (b) present a complete picture of the expressive power of various classes of automata with finitary and infinitary acceptance conditions; (c) show that the languages defined by finitary parity automata exactly characterize the star-free fragment of ωB-regular languages [4]; and (d) show that emptiness is NLOGSPACE-complete and universality as well as language inclusion are PSPACE-complete for finitary automata.