# Büchi automaton

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2013

2013

- TACAS
- 2013

The automata-theoretic approach for model checking of linear-time temporal properties involves the emptiness check of a large B… (More)

Is this relevant?

2011

2011

- CSL
- 2011

Complementation of Büchi automata, required for checking automata containment, is of major theoretical and practical interest in… (More)

Is this relevant?

2010

2010

- ICALP
- 2010

Alternating automata play a key role in the automata-theoretic approach to specification, verification, and synthesis of reactive… (More)

Is this relevant?

2009

2009

- STACS
- 2009

The precise complexity of complementing Büchi automata is an intriguing and long standing problem. While optimal complementation… (More)

Is this relevant?

2008

2008

- International Conference on Intelligent…
- 2008

Model checking is an automatic technique for verifying finite state concurrent systems. A rapid solution for the model checking… (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- Formal Methods in System Design
- 2005

This paper presents an on-the-fly and symbolic technique for efficiently checking timed automata emptiness. It is symbolic… (More)

Is this relevant?

2004

2004

- ATVA
- 2004

The complementation problem for nondeterministic word automata has numerous applications in formal verification. In particular… (More)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

- CIAA
- 2003

We present a new procedure for the translation of propositional linear-time temporal logic (LTL) formulas to equivalent… (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- CAV
- 2000

We present an algorithm to generate small Büchi automata fo r LTL formulae. We describe a heuristic approach consisting of th ree… (More)

Is this relevant?

Highly Cited

1987

Highly Cited

1987

- Theor. Comput. Sci.
- 1987

The problem of complementing Biichi automata arises when developing decision procedures for temporal logics of programs… (More)

Is this relevant?