Skip to main content
Springer Nature Link
Log in

Observations on Determinization of Büchi Automata

  • Conference paper
Implementation and Application of Automata (CIAA 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3845))

Included in the following conference series:

Abstract

The two determinization procedures of Safra and Muller-Schupp for Büchi automata are compared, based on an implementation in a program called OmegaDet.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. McNaughton, R.: Testing and generating infinite sequences by a finite automaton. Information and Control 9, 521–530 (1966)

    Article  MathSciNet  MATH  Google Scholar 

  2. Thomas, W.: Automata on Infinite Objects. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science. Formal models and semantics, vol. B, pp. 133–191. Elsevier Science Publishers B.V., Amsterdam (1990)

    Google Scholar 

  3. Perrin, D., Pin, J.E.: Infinite Words: Automata, Semigroups, Logic and Games. Pure and Applied Mathematics, vol. 141. Elsevier, Amsterdam (2004)

    MATH  Google Scholar 

  4. Michel, M.: Complementation is more difficult with automata on infinite words. CNET, Paris (1988)

    Google Scholar 

  5. Löding, C.: Optimal bounds for the transformation of omega-automata. In: Pandu Rangan, C., Raman, V., Ramanujam, R. (eds.) FST TCS 1999. LNCS, vol. 1738, pp. 97–109. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  6. Safra, S.: On the Complexity of ω-Automata. In: Proc. of the 29th Symp. on Foundations of Computer Science, pp. 319–327. IEEE Computer Society Press, Los Alamitos (1988)

    Google Scholar 

  7. Muller, D., Schupp, P.: 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)

    Article  MathSciNet  MATH  Google Scholar 

  8. Miyano, S., Hayashi, T.: Alternating Finite Automata on ω-Words. Theor. Comput. Sci. 32, 321–330 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  9. Thomas, W.: Languages, Automata and Logic. In: Handbook of Formal Language Theory, vol. III, pp. 389–455. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  10. Boigelot, B., Jodogne, S., Wolper, P.: An Effective Decision Procedure for Linear Arithmetic with Integer and Real Variables. ACM Transaction on Computational Logic (to appear, 2005)

    Google Scholar 

  11. (The Liège Automata-based Symbolic Handler (LASH)), available at http://www.montefiore.ulg.ac.be/~boigelot/research/lash/

  12. Schulte-Althoff, C.: Construction of deterministic ω-automata: A comparative analysis of the algorithms by safra and muller/schupp. Diplomarbeit, RWTH Aachen (2005)

    Google Scholar 

  13. Etessami, K., Wilke, T., Schuller, R.A.: Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 694–707. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  14. Kähler, D.: Determinisierung von ω-Automaten. Diplomarbeit, Christian-Albrechts-Universität zu Kiel (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Lehrstuhl Informatik 7, RWTH Aachen, 52056, Aachen, Germany

    Christoph Schulte Althoff, Wolfgang Thomas & Nico Wallmeier

Authors
  1. Christoph Schulte Althoff
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wolfgang Thomas
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Nico Wallmeier
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Sophia Antipolis, Laboratoire I3S, Les Algorithmes - bât. Euclide B, Université de Nice, 2000, route des lucioles, BP 121, 06903, Sophia Antipolis - Cedex, France

    Jacques Farré

  2. Sophia Antipolis, Ecole Polytechnique, Université de Nice, 930, route des colles, BP 145, 06903, Sophia Antipolis - Cedex, France

    Igor Litovsky

  3. Laboratoire I3S, Université de Nice, Sophia Antipolis & CNRS, France

    Sylvain Schmitz

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Althoff, C.S., Thomas, W., Wallmeier, N. (2006). Observations on Determinization of Büchi Automata. In: Farré, J., Litovsky, I., Schmitz, S. (eds) Implementation and Application of Automata. CIAA 2005. Lecture Notes in Computer Science, vol 3845. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11605157_22

Download citation

  • DOI: https://doi.org/10.1007/11605157_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-31023-5

  • Online ISBN: 978-3-540-33097-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics