Abstract
Two-way alternating automata on trees were introduced by Vardi [Va98]. Here we consider alternating two-way automata on graphs and show the decidability of the following problem: “does a given automaton with the Büchi condition accept any finite graph?” Using this result we demonstrate the decidability of the finite model problem for a certain fragment of the modal µ-calculus with backward modalities.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
H. Andreka, J. van Benthem and I. Nemeti, Modal Languages and Bounded Fragments of Predicate Logic, Journal of Philosophical Logic, 27 (1998), pp. 217–274.
E. A. Emerson and C. Jutla: Tree Automata, Mu-Calculus and Determinacy, in Proc. 32th IEEE Symposium on Foundations of Computer Science pages 368–377.
R. S. Street and E. A. Emerson: An Automata theoretic procedure for the propositional mu-calculus. Information and Computation, 81:249–264.
E. Gradel and I. Walukiewicz: Guarded Fixed Point Logic, Proc. 14th IEEE Symp. on Logic in Computer Science, pages 45–54.
D. Kozen: Results on the Propositional µ-calculus, in Theoretical Computer Science, Vol. 27 pages 333–354.
O. Lichtenstein, A. Pnueli and L. Zuck: The Glory of the Past, in Logics of Programs, Vol. 193 LNCS pages 196–218.
A. W. Mostowski: Games with Forbidden Positions, Technical Report 78, University of Gdañsk, 1991.
D. E. Muller and P. E. Schupp: Alternating automata on infinite trees, Theoretical Computer Science, 54:267–276, 1987.
D. Niwiñski: Fixed Points vs. Infinite Generation, in Proc. 3rd IEEE LICS pages 402–409.
R. S. Streett:Propositional dynamic logic of looping and converse, in Information and Control, Vol. 54, pages 121–141.
Wolfgang Thomas: Languages, Automata, and Logic, in Handbook of Formal Language Theory, III, Springer, pages 389–455.
M. Vardi: Why is modal logic so robustly decidable?, in Descriptive Complexity and Finite Models, AMS, pages 149–184.
M. Vardi: Reasoning About the Past with Two-way Automata, in Vol. 1443 LNCS pages 628–641.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bojańczyk, M. (2001). The Finite Graph Problem for Two-Way Alternating Automata. In: Honsell, F., Miculan, M. (eds) Foundations of Software Science and Computation Structures. FoSSaCS 2001. Lecture Notes in Computer Science, vol 2030. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45315-6_6
Download citation
DOI: https://doi.org/10.1007/3-540-45315-6_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41864-1
Online ISBN: 978-3-540-45315-4
eBook Packages: Springer Book Archive