Abstract
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 Σ2 0-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.
The research was supported by Austrian NFN ARiSE.
Fuller version with proofs available at [7]
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alpern, B., Schneider, F.B.: Defining Liveness. Information Processing Letters 21(4), 181–185 (1985)
Alur, R., Henzinger, T.A.: Finitary Fairness. ACM Transactions on Programming Languages and Systems 20(6), 1171–1194 (1998)
Bojanczyk, M.: Beyond omega-regular languages. In: International Symposium on Theoretical Aspects of Computer Science, STACS, pp. 11–16 (2010)
Bojanczyk, M., Colcombet, T.: Bounds in ω-Regularity. In: Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science, LICS 2006, pp. 285–296. IEEE Computer Society, Los Alamitos (2006)
Bojanczyk, M., Torunczyk, S.: Deterministic Automata and Extensions of Weak MSO. In: International Conference on the Foundations of Software Technology and Theoretical Computer Science, FSTTCS, pp. 73–84 (2009)
Büchi, J.R.: On a decision method in restricted second-order arithmetic. In: Proceedings of the 1st International Congress of Logic, Methodology, and Philosophy of Science, CLMPS 1960, pp. 1–11. Stanford University Press, Stanford (1962)
Chatterjee, K., Fijalkow, N.: Finitary languages. CoRR abs/1101.1727 (2011)
Chatterjee, K., Henzinger, T.A., Horn, F.: Finitary Winning in ω-regular Games. ACM Transactions on Computational Logic 11(1) (2009)
Choueka, Y.: Theories of automata on ω-tapes: A simplified approach. Journal of Computer and System Sciences 8, 117–141 (1974)
Gurevich, Y., Harrington, L.: Trees, Automata, and Games. In: Proceedings of the 14th Annual ACM Symposium on Theory of Computing, STOC 1982, pp. 60–65. ACM Press, New York (1982)
Hummel, S., Skrzypczak, M., Toruńczyk, S.: On the Topological Complexity of MSO+U and Related Automata Models. In: Hliněný, P., Kučera, A. (eds.) MFCS 2010. LNCS, vol. 6281, pp. 429–440. Springer, Heidelberg (2010)
Manna, Z., Pnueli, A.: The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer, Heidelberg (1992)
Pnueli, A., Rosner, R.: On the Synthesis of a Reactive Module. In: Proceedings of the 16th Annual ACM Symposium on Principles of Programming Languages, POPL 1989, pp. 179–190 (1989)
Ramadge, P.J., Wonham, W.M.: Supervisory control of a class of discrete-event processes. SIAM Journal on Control and Optimization 25(1), 206–230 (1987)
Safra, S.: Exponential Determinization for ω-Automata with Strong-Fairness Acceptance Condition. In: Annual ACM Symposium on Theory of Computing, STOC. ACM Press, New York (1992)
Thomas, W.: Languages, Automata, and Logic. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages. Beyond Words, vol. 3, pp. 389–455. Springer, Heidelberg (1997)
Wadge, W.W.: Reducibility and Determinateness of Baire Spaces. PhD thesis, UC Berkeley (1984)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chatterjee, K., Fijalkow, N. (2011). Finitary Languages. In: Dediu, AH., Inenaga, S., Martín-Vide, C. (eds) Language and Automata Theory and Applications. LATA 2011. Lecture Notes in Computer Science, vol 6638. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21254-3_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-21254-3_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21253-6
Online ISBN: 978-3-642-21254-3
eBook Packages: Computer ScienceComputer Science (R0)