Advertisement

Abstract

The introduction of an efficient determinisation technique for Büchi automata by Safra has been a milestone in automata theory. To name only a few applications, efficient determinisation techniques for ω-word automata are the basis for several manipulations of ω-tree automata (most prominently the nondeterminisation of alternating tree automata) as well as for satisfiability checking and model synthesis for branching- and alternating-time logics. This paper proposes a determinisation technique that is simpler than the constructions of Safra, Piterman, and Muller and Schupp, because it separates the principle acceptance mechanism from the concrete acceptance condition. The principle mechanism intuitively uses a Rabin condition on the transitions; we show how to obtain an equivalent Rabin transition automaton with approximately (1.65 n) n states from a nondeterministic Büchi automaton with n states. Having established this mechanism, it is simple to develop translations to automata with standard acceptance conditions. We can construct standard Rabin automata whose state-space is bilinear in the size of the input alphabet and the state-space of the Rabin transition automaton, or, for large input alphabets, contains approximately (2.66 n) n states, respectively. We also provide a flexible translation to parity automata with O(n!2) states and 2n priorities based on a later introduction record, and hence connect the transformation of the acceptance condition to other record based transformations known from the literature.

Keywords

History Tree Acceptance Condition Tree Automaton Input Word History Transition 
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

  1. 1.
    Büchi, J.R.: On a decision method in restricted second order arithmetic. In: Proceedings of the International Congress on Logic, Methodology, and Philosophy of Science, 1960, Berkeley, California, USA, pp. 1–11. Stanford University Press (1962)Google Scholar
  2. 2.
    Rabin, M.O., Scott, D.S.: Finite automata and their decision problems. IBM Journal of Research and Development 3, 115–125 (1959)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Safra, S.: On the complexity of ω-automata. In: Proceedings of the 29th Annual Symposium on Foundations of Computer Science (FOCS 1988), White Plains, New York, USA, pp. 319–327. IEEE Computer Society Press, Los Alamitos (1988)Google Scholar
  4. 4.
    Muller, D.E., Schupp, P.E.: Simulating alternating tree automata by nondeterministic automata: new results and new proofs of the theorems of Rabin, McNaughton and Safra. Theoretical Computer Science 141, 69–107 (1995)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Piterman, N.: From nondeterministic Büchi and Streett automata to deterministic parity automata. Journal of Logical Methods in Computer Science 3 (2007)Google Scholar
  6. 6.
    Muller, D.E.: Infinite sequences and finite machines. In: Proceedings of the 4th Annual Symposium on Switching Circuit Theory and Logical Design (FOCS 1963), Chicago, Chicago, Illinois, USA, pp. 3–16. IEEE Computer Society Press, Los Alamitos (1963)CrossRefGoogle Scholar
  7. 7.
    McNaughton, R.: Testing and generating infinite sequences by a finite automaton. Information and Control 9, 521–530 (1966)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Yan, Q.: Lower bounds for complementation of omega-automata via the full automata technique. Journal of Logical Methods in Computer Science 4 (2008)Google Scholar
  9. 9.
    Church, A.: Logic, arithmetic and automata. In: Proceedings of the International Congress of Mathematicians, Institut Mittag-Leffler, Djursholm, Sweden, 1962 (Stockholm 1963), 15–22 August, pp. 23–35 (1962)Google Scholar
  10. 10.
    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), Austin, Texas, USA, pp. 179–190. ACM Press, New York (1989)Google Scholar
  11. 11.
    Rabin, M.O.: Decidability of second order theories and automata on infinite trees. Transaction of the American Mathematical Society 141, 1–35 (1969)MathSciNetzbMATHGoogle Scholar
  12. 12.
    Büchi, J.R., Landweber, L.H.: Solving sequential conditions by finite-state strategies. Transactions of the American Mathematical Society 138, 295–311 (1969)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Büchi, J.R., Landweber, L.H.: Definability in the monadic second-order theory of successor. Journal of Symbolic Logic 34, 166–170 (1969)MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    Wilke, T.: Alternating tree automata, parity games, and modal μ-calculus. Bulletin of the Belgian Mathematical Society 8 (2001)Google Scholar
  15. 15.
    Emerson, E.A.: Automata, tableaux and temporal logics. In: Parikh, R. (ed.) Logic of Programs 1985. LNCS, vol. 193, pp. 79–88. Springer, Heidelberg (1985)CrossRefGoogle Scholar
  16. 16.
    Kupferman, O., Vardi, M.: Module checking revisited. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol. 1254, pp. 36–47. Springer, Heidelberg (1997)CrossRefGoogle Scholar
  17. 17.
    Emerson, E.A., Jutla, C.S.: Tree automata, μ-calculus and determinacy. In: Proceedings of the 32nd Annual Symposium on Foundations of Computer Science (FOCS 1991), San Juan, Puerto Rico, pp. 368–377. IEEE Computer Society Press, Los Alamitos (1991)CrossRefGoogle Scholar
  18. 18.
    Schewe, S., Finkbeiner, B.: Satisfiability and finite model property for the alternating-time μ-calculus. In: Ésik, Z. (ed.) CSL 2006. LNCS, vol. 4207, pp. 591–605. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  19. 19.
    Gurevich, Y., Harrington, L.: Trees, automata, and games. In: Proceedings of the 14th Annual ACM Symposium on Theory of Computing (STOC 1982), San Francisco, California, USA, pp. 60–65. ACM Press, New York (1982)Google Scholar
  20. 20.
    Liu, W., Wang, J.: A tigher analysis of Piterman’s Büchi determinization. Information Processing Letters (submitted, 2009)Google Scholar
  21. 21.
    Temme, N.M.: Asymptotic estimates of Stirling numbers. Studies in Applied Mathematics 89, 233–243 (1993)MathSciNetCrossRefzbMATHGoogle Scholar
  22. 22.
    Friedgut, E., Kupferman, O., Vardi, M.Y.: Büchi complementation made tighter. International Journal of Foundations of Computer Science 17, 851–867 (2006)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Sven Schewe
    • 1
  1. 1.University of LiverpoolUK

Personalised recommendations