Büchi store: an open repository of büchi automata

Authors:
Yih-Kuen Tsay;Ming-Hsien Tsai;Jinn-Shu Chang;Yi-Wen Chang
Affiliations:
Department of Information Management, National Taiwan University, Taiwan;Department of Information Management, National Taiwan University, Taiwan;Department of Information Management, National Taiwan University, Taiwan;Department of Information Management, National Taiwan University, Taiwan
Venue:
TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
Year:
2011

Citing 14
Cited 4

The complementation problem for Bu¨chi automata with applications to temporal logic

Theoretical Computer Science
A hierarchy of temporal properties (invited paper, 1989)

PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Weak alternating automata are not that weak

ACM Transactions on Computational Logic (TOCL)
From States to Transitions: Improving Translation of LTL Formulae to Büchi Automata

FORTE '02 Proceedings of the 22nd IFIP WG 6.1 International Conference Houston on Formal Techniques for Networked and Distributed Systems
On-the-Fly Verification of Linear Temporal Logic

FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume I - Volume I
Improved Automata Generation for Linear Temporal Logic

CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Efficient Büchi Automata from LTL Formulae

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Fast LTL to Büchi Automata Translation

CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Theoretical issues in the design and verification of distributed systems

Theoretical issues in the design and verification of distributed systems
From Nondeterministic Buchi and Streett Automata to Deterministic Parity Automata

LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
On the complexity of omega -automata

SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Spin model checker, the: primer and reference manual

Spin model checker, the: primer and reference manual
Complementation, Disambiguation, and Determinization of Büchi Automata Unified

ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
GOAL extended: towards a research tool for omega automata and temporal logic

TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems

LTL translation improvements in spot

VECoS'11 Proceedings of the Fifth international conference on Verification and Evaluation of Computer and Communication Systems
Advanced automata minimization

POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Privacy promises that can be kept: a policy analysis method with application to the HIPAA privacy rule

Proceedings of the 18th ACM symposium on Access control models and technologies
LTL translation improvements in Spot 1.0

International Journal of Critical Computer-Based Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce the Büchi Store, an open repository of Büchi automata formodel-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 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 Büchi automata is also useful as a benchmark for evaluating complementation or translation algorithms and as examples for studying Büchi automata and temporal logic.