Büchi Store: an open repository of \(\omega \)-automata

  • Yih-Kuen TsayEmail author
  • Ming-Hsien Tsai
  • Jinn-Shu Chang
  • Yi-Wen Chang
  • Chi-Shiang Liu
TACAS 2011


We introduce Büchi Store, an open repository of Büchi automata and other types of \(\omega \)-automata for model-checking practice, research, and education. The repository contains Büchi automata and their complements for common specification patterns and numerous temporal formulae. These automata are made as small as possible by various construction techniques in view of the fact that smaller automata are easier to understand and often help in speeding up the model-checking process. The repository is open, allowing the user to add automata that define new languages or are smaller than existing equivalent ones. Such a collection of Büchi automata is also useful as a benchmark for evaluating translation or complementation algorithms and as examples for studying Büchi automata and temporal logic. These apply analogously for other types of \(\omega \)-automata, including deterministic Büchi and deterministic parity automata, which are also collected in the repository. In particular, the use of smaller deterministic parity automata as an intermediary helps reduce the complexity of automatic synthesis of reactive systems from temporal specifications.


Linear Temporal Logic Temporal Formula Deterministic Automaton Translation Algorithm Recurrence Class 
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.



This work was supported in part by National Science Council, Taiwan, under the grant NSC97-2221-E-002-074-My3. We thank Moshe Vardi and Wolfgang Thomas for teaching us so much about \(\omega \)-automata. Moshe’s enthusiasm in pursuing the automata-theoretic approach to model checking was a great source of inspiration for us to create Büchi Store. The diagram depicting the Temporal Hierarchy was learned from Wolfgang while he explained to us the use of DBW and DCW in the classification. Moshe’s Ph.D. student Seth Fogarty, during his visit to our group in the summer of 2009, witnessed the initiation of Büchi Store and made several useful comments. We thank Barbara Jobstmann whose suggestion of including deterministic parity automata prompted us to expand the Store to its current scope. The idea of maintaining a containment partial order of the language-equivalence classes should be shared with a participant of ETAPS 2011 whose name we could not recall; we thank him as well. Finally, we thank the three anonymous reviewers whose constructive and very detailed comments have helped improve the paper tremendously.

Supplementary material


  1. 1.
    Boker, U., Kupferman, O.: Co-ing Büchi made tight and useful. In: Proceedings of the 24th annual IEEE symposium on logic in computer science (LICS ’09), pp. 245–254. IEEE Computer Society (2009)Google Scholar
  2. 2.
    Büchi J.R.: On a decision method in restricted second-order arithmetic. In: Proceedings of the 1960 international congress on logic, methodology and, philosophy of science, pp. 1–11 (1962)Google Scholar
  3. 3.
    Chatterjee, K., Henzinger, T.A., Jobstmann, B., Singh, R.: QUASY: Quantitative synthesis tool. In: Proceedings of the 17th international conference on tools and algorithms for the construction and analysis of systems (TACAS ’11), LNCS 6605, pp. 267–271. Springer, Heidelberg (2011)Google Scholar
  4. 4.
    Cichoń J., Czubak A., Jasiński A.: Minimal Büchi automata for certain classes of LTL formulas. In: Proceedings of the fourth international conference on dependability of computer systems, pp. 17–24. IEEE (2009)Google Scholar
  5. 5.
  6. 6.
    Couvreur, J.M.: On-the-fly verification of linear temporal logic. In: World Congress on formal methods in the development of computing systems (FM ’99), LNCS 1708, pp. 253–271. Springer, Heidelberg (1999)Google Scholar
  7. 7.
    Daniele, M., Giunchiglia, F., Vardi, M.Y.: Improved automata generation for linear temporal logic. In: Proceedings of the 11th international conference on computer-aided verification (CAV ’99), LNCS 1633, pp. 249–260. Springer, Heidelberg (1999)Google Scholar
  8. 8.
    Dwyer, M.B., Avrunin, G.S., Corbett, J.C.: Patterns in property specifications for finite-state verification. In: Proceedings of the 21st international conference on software engineering (ICSE ’99), pp. 411–420 (1999)Google Scholar
  9. 9.
    Etessami K., Holzmann G.J.: Optimizing Büchi automata. In: Proceedings of the 11th international conference on concurrency theory (CONCUR ’00), LNCS 1877, pp. 153–167. Springer, Heidelberg (2000)Google Scholar
  10. 10.
    Gastin, P., Oddoux, D.: LTL 2 BA: fast translation from LTL formulae to Büchi automata.
  11. 11.
    Gastin P., Oddoux D.: Fast LTL to Büchi automata translation. In: Proceedings of the 13th international conference on computer-aided verification (CAV ’01), LNCS 2102, pp. 53–65. Springer, Heidelberg (2001)Google Scholar
  12. 12.
    Giannakopoulou D., Lerda F.: From states to transitions: improving translation of LTL formulae to Büchi automata. In: Proceedings of the IFIP WG 6.1 international conference on formal techniques for networked and distributed sytems (FORTE ’02), LNCS 2529, pp. 308–326. Springer, Heidelberg (2002)Google Scholar
  13. 13.
    Grädel, E., Thomas, W., Wilke, T.: Automata, logics, and infinite games (LNCS 2500). Springer, Heidelberg (2002)CrossRefGoogle Scholar
  14. 14.
    Holzmann, G.J.: The SPIN model checker: primer and reference manual. Addison-Wesley, Boston (2003)Google Scholar
  15. 15.
    Kähler, D., Wilke, T.: Complementation, disambiguation, and determinization of Büchi automata unified. In: Proceedings of the 35th international colloqium on automata, languages, and programming (ICALP ’08), LNCS 5125, pp. 724–735. Springer, Heidelberg (2008) Google Scholar
  16. 16.
    Kesten, Y., Pnueli, A.: Complete proof system for QPTL. J. Logic Comput. 12(5), 701–745 (2002)MathSciNetzbMATHCrossRefGoogle Scholar
  17. 17.
    Kupferman, O., Vardi, M.Y.: Weak alternating automata are not that weak. ACM Trans. Comput. Logic 2(3), 408–429 (2001)MathSciNetzbMATHCrossRefGoogle Scholar
  18. 18.
    Landweber, L.H.: Decision problems for \(\omega \)-automata. Math. Syst. Theory 3(4), 376–384 (1969)MathSciNetzbMATHCrossRefGoogle Scholar
  19. 19.
    Manna, Z., Pnueli, A.: A hierarchy of temporal properties. In: Proceedings of the 9th ACM symposium on principles of distributed computing (PODC ’90), pp. 377–408. ACM (1990)Google Scholar
  20. 20.
    Manna, Z., Pnueli, A.: The temporal logic of reactive and concurrent systems: specification. Springer, Heidelberg (1992)CrossRefGoogle Scholar
  21. 21.
    Michel, M.: Complementation is more difficult with automata on infinite words. In: CNET, Paris (1988)Google Scholar
  22. 22.
  23. 23.
    Piterman, N.: From nondeterministic Büchi and Streett automata to deterministic parity automata. In: Proceedings of the 21th annual IEEE symposium on logic in computer science (LICS ’06), pp. 255–264. IEEE (2006)Google Scholar
  24. 24.
    Safra, S.: On the complexity of \(\omega \)-automta. In: Proceedings of the 29th annual IEEE symposium on foundations of computer science (FOCS ’88), pp. 319–327. IEEE (1988)Google Scholar
  25. 25.
    Schewe, S.: Büchi complementation made tight. In: Proceedings of the 26th international symposium on theoretical aspects of computer science (STACS ’09), LIPIcs 3 Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, pp. 661–672 (2009)Google Scholar
  26. 26.
    Sistla, A.P.: Theoretical issues in the design and verification of distributed systems. PhD thesis, Harvard (1983)Google Scholar
  27. 27.
    Sistla, A.P., Vardi, M.Y., Wolper, P.: The complementation problem for Büchi automata with applications to temporal logic. Theo. Comp. Sci. 49, 217–237 (1987)MathSciNetzbMATHCrossRefGoogle Scholar
  28. 28.
    Sohail, S., Somenzi, F., Ravi, K.: A hybrid algorithm for LTL games. In Proceedings of the 9th international conference on verification, model checking, and abstract interpretation (VMCAI ’08), LNCS 4905, pp. 309–323. Springer, Heidelberg (2008)Google Scholar
  29. 29.
    Somenzi, F., Bloem, R.: Efficient Büchi automata from LTL formulae. In Proceedings of the 12th international conference on computer-aided verification (CAV ’00), LNCS 1855, pp. 248–263. Springer, Heidelberg (2000)Google Scholar
  30. 30.
    The Spec Patterns Repository.
  31. 31.
  32. 32.
    Tsai, M.-H., Fogarty, S., Vardi, M.Y., Tsay, Y.-K.: State of Büchi complementation. In: Proceedings of the 15th international conference on implementation and application of automata (CIAA ’10), LNCS 6482, pp. 261–271. Springer, Heidelberg (2011)Google Scholar
  33. 33.
    Tsay, Y.-K., Chen, Y.-F., Tsai, M.-H., Chan, W.-C., Luo, C.-J.: GOAL extended: towards a research tool for omega-automata and temporal logic. In: Proceedings of the 14th international conference on tools and algorithms for the construction and analysis of systems (TACAS ’08), LNCS 4963, pp. 346–350. Springer, Heidelberg (2008)Google Scholar
  34. 34.
    Tsay, Y.-K., Tsai, M.-H., Chang, J.-S., Chang, Y.-W.: Büchi Store: an open repository of Büchi automata. In: Proceedings of the 17th international conference on tools and algorithms for the construction and analysis of systems (TACAS ’11), LNCS 6605, pp. 262–266. Springer, Heidelberg, (2011)Google Scholar
  35. 35.
    Vardi, M.Y., Wolper, P.: An automata-theoretic approach to automatic program verification. In: Proceedings of the 1st annual IEEE symposium on logic in computer science (LICS ’86), pp. 332–344. IEEE (1986)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Yih-Kuen Tsay
    • 1
    Email author
  • Ming-Hsien Tsai
    • 1
  • Jinn-Shu Chang
    • 1
  • Yi-Wen Chang
    • 1
  • Chi-Shiang Liu
    • 1
  1. 1.Department of Information ManagementNational Taiwan UniversityTaipeiTaiwan

Personalised recommendations