Büchi Store: An Open Repository of Büchi Automata

We introduce the Buchi Store, an open repository of Buchi automata formodel-checking practice, research, and education.The repository contains Buchi 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 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 new automata or smaller ones that are equivalent to some existing automaton. Such a collection of Buchi automata is also useful as a benchmark for evaluating complementation or translation algorithms and as examples for studying Buchi automata and temporal logic.

[1]  Dimitra Giannakopoulou,et al.  From States to Transitions: Improving Translation of LTL Formulae to Büchi Automata , 2002, FORTE.

[2]  S. Anderson,et al.  Secure Synthesis of Code: A Process Improvement Experiment , 1999, World Congress on Formal Methods.

[3]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[4]  Shin Nakajima,et al.  The SPIN Model Checker : Primer and Reference Manual , 2004 .

[5]  Pierre Wolper,et al.  The Complementation Problem for Büchi Automata with Appplications to Temporal Logic , 1987, Theor. Comput. Sci..

[6]  Thomas Wilke,et al.  Complementation, Disambiguation, and Determinization of Büchi Automata Unified , 2008, ICALP.

[7]  Yih-Kuen Tsay,et al.  GOAL Extended: Towards a Research Tool for Omega Automata and Temporal Logic , 2008, TACAS.

[8]  Jean-Michel Couvreur,et al.  On-the-Fly Verification of Linear Temporal Logic , 1999, World Congress on Formal Methods.

[9]  Paul Gastin,et al.  Fast LTL to Büchi Automata Translation , 2001, CAV.

[10]  S. Safra.  On The Complexity of w-Automata , 1988 .

[11]  Nir Piterman.  From Nondeterministic Büchi and Streett Automata to Deterministic Parity Automata , 2007, Log. Methods Comput. Sci..

[12]  Allan Clark,et al.  Semantic-Based Development of Service-Oriented Systems , 2006, FORTE.

[13]  Orna Kupferman,et al.  Büchi Complementation Made Tighter , 2006, Int. J. Found. Comput. Sci..

[14]  Sven Schewe,et al.  Büchi complementation made tight , 2009, STACS.

[15]  J. R. Büchi.  On a Decision Method in Restricted Second Order Arithmetic , 1990 .

[16]  J. R. Büchi.  Symposium on Decision Problems: On a Decision Method in Restricted Second Order Arithmetic , 1966 .

[17]  Fausto Giunchiglia,et al.  Improved Automata Generation for Linear Temporal Logic , 1999, CAV.

[18]  Aravinda Prasad Sistla,et al.  Theoretical issues in the design and verification of distributed systems , 1983 .

[19]  Pierre Wolper,et al.  An Automata-Theoretic Approach to Automatic Program Verification (Preliminary Report) , 1986, LICS.

[20]  Fabio Somenzi,et al.  Efficient Büchi Automata from LTL Formulae , 2000, CAV.

[21]  S. Safra,et al.  On the complexity of omega -automata , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[22]  Orna Kupferman,et al.  Weak alternating automata are not that weak , 1997, Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems.

[23]  Rajeev Alur,et al.  A Temporal Logic of Nested Calls and Returns , 2004, TACAS.

[24]  Zohar Manna,et al.  A hierarchy of temporal properties (invited paper, 1989) , 1990, PODC '90.