Skip to main content

Advertisement

SpringerLink
Log in
Menu
Find a journal Publish with us
Search
Cart
Book cover

International Conference on Foundations of Software Science and Computational Structures

FoSSaCS 2012: Foundations of Software Science and Computational Structures pp 150–164Cite as

  1. Home
  2. Foundations of Software Science and Computational Structures
  3. Conference paper
Improved Ramsey-Based Büchi Complementation

Improved Ramsey-Based Büchi Complementation

  • Stefan Breuers17,
  • Christof Löding17 &
  • Jörg Olschewski17 
  • Conference paper
  • 959 Accesses

  • 11 Citations

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

Abstract

We consider complementing Büchi automata by applying the Ramsey-based approach, which is the original approach already used by Büchi and later improved by Sistla et al. We present several heuristics to reduce the state space of the resulting complement automaton and provide experimental data that shows that our improved construction can compete (in terms of finished complementation tasks) also in practice with alternative constructions like rank-based complementation. Furthermore, we show how our techniques can be used to improve the Ramsey-based complementation such that the asymptotic upper bound for the resulting complement automaton is \(2^{{\mathcal O}(n {\rm log} n)}\) instead of \(2^{{\mathcal O}(n^2)}\).

Keywords

  • Complementation Method
  • Greedy Strategy
  • Alternative Construction
  • Total Preorder
  • Loop Part

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.

Download conference paper PDF

References

  1. Abdulla, P.A., Chen, Y.-F., Clemente, L., Holík, L., Hong, C.-D., Mayr, R., Vojnar, T.: Advanced Ramsey-based Büchi Automata Inclusion Testing. In: Katoen, J.-P., König, B. (eds.) CONCUR 2011 – Concurrency Theory. LNCS, vol. 6901, pp. 187–202. Springer, Heidelberg (2011)

    CrossRef  Google Scholar 

  2. Büchi, J.R.: On a decision method in restricted second order arithmetic. In: Logic, Methodology and Philosophy of Science, pp. 1–11. Stanford Univerity Press (1962)

    Google Scholar 

  3. Fogarty, S., Kupferman, O., Vardi, M.Y., Wilke, T.: Unifying Büchi complementation constructions. In: CSL (2011)

    Google Scholar 

  4. Fogarty, S., Vardi, M.Y.: Efficient Büchi Universality Checking. In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol. 6015, pp. 205–220. Springer, Heidelberg (2010)

    CrossRef  Google Scholar 

  5. Friedgut, E., Kupferman, O., Vardi, M.Y.: Büchi complementation made tighter. International Journal of Foundations of Computer Science 17(4), 851–868 (2006)

    CrossRef  MathSciNet  MATH  Google Scholar 

  6. Kähler, D., Wilke, T.: Complementation, Disambiguation, and Determinization of Büchi Automata Unified. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 724–735. Springer, Heidelberg (2008)

    CrossRef  Google Scholar 

  7. Klarlund, N.: Progress measures for complementation of ω-automata with applications to temporal logic. In: FOCS, pp. 358–367. IEEE Computer Society (1991)

    Google Scholar 

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

    Google Scholar 

  9. Piterman, N.: From nondeterministic Büchi and Streett automata to deterministic parity automata. Logical Methods in Computer Science 3(3) (2007)

    Google Scholar 

  10. Ramsey, F.P.: On a problem of formal logic. Proceedings of the London Mathematical Society 2(1), 264 (1930)

    CrossRef  Google Scholar 

  11. Safra, S.: On the complexity of ω-automata. In: FOCS, pp. 319–327. IEEE (1988)

    Google Scholar 

  12. Schewe, S.: Büchi complementation made tight. In: STACS. LIPIcs, vol. 3, pp. 661–672. Schloss Dagstuhl (2009)

    Google Scholar 

  13. Sistla, A.P., Vardi, M.Y., Wolper, P.: The complementation problem for Büchi automata with applications to temporal logic. Theoretical Computer Science 49, 217–237 (1987)

    CrossRef  MathSciNet  MATH  Google Scholar 

  14. Thomas, W.: Automata on infinite objects. In: Handbook of Theoretical Computer Science. Formal Models and Semantics, vol. B, pp. 133–192. Elsevier Science Publishers, Amsterdam (1990)

    Google Scholar 

  15. Tsai, M.-H., Fogarty, S., Vardi, M.Y., Tsay, Y.-K.: State of Büchi Complementation. In: Domaratzki, M., Salomaa, K. (eds.) CIAA 2010. LNCS, vol. 6482, pp. 261–271. Springer, Heidelberg (2011)

    CrossRef  Google Scholar 

  16. Yan, Q.: Lower bounds for complementation of ω-automata via the full automata technique. Logical Methods in Computer Science 4(1) (2008)

    Google Scholar 

  17. http://www.automata.rwth-aachen.de/research/Alekto/

Download references

Author information

Authors and Affiliations

  1. RWTH Aachen University, Germany

    Stefan Breuers, Christof Löding & Jörg Olschewski

Authors
  1. Stefan Breuers
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Christof Löding
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jörg Olschewski
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. IT University of Copenhagen, Rued Langgaards Vej 7, 2300, Copenhagen, Denmark

    Lars Birkedal

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Breuers, S., Löding, C., Olschewski, J. (2012). Improved Ramsey-Based Büchi Complementation. In: Birkedal, L. (eds) Foundations of Software Science and Computational Structures. FoSSaCS 2012. Lecture Notes in Computer Science, vol 7213. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28729-9_10

Download citation

  • .RIS
  • .ENW
  • .BIB
  • DOI: https://doi.org/10.1007/978-3-642-28729-9_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-28728-2

  • Online ISBN: 978-3-642-28729-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Share this paper

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

Search

Navigation

  • Find a journal
  • Publish with us

Discover content

  • Journals A-Z
  • Books A-Z

Publish with us

  • Publish your research
  • Open access publishing

Products and services

  • Our products
  • Librarians
  • Societies
  • Partners and advertisers

Our imprints

  • Springer
  • Nature Portfolio
  • BMC
  • Palgrave Macmillan
  • Apress
  • Your US state privacy rights
  • Accessibility statement
  • Terms and conditions
  • Privacy policy
  • Help and support

167.114.118.210

Not affiliated

Springer Nature

© 2023 Springer Nature