Büchi automaton

Known as: Buechi automata, Büchi automata, Buchi automaton 
In computer science and automata theory, a Büchi automaton is a type of ω-automaton, which extends a finite automaton to infinite inputs. It accepts… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
The automata-theoretic approach for model checking of linear-time temporal properties involves the emptiness check of a large B… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
2011
2011
Complementation of Büchi automata, required for checking automata containment, is of major theoretical and practical interest in… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2010
2010
Alternating automata play a key role in the automata-theoretic approach to specification, verification, and synthesis of reactive… (More)
  • figure 1
  • figure 2
Is this relevant?
2009
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
Model checking is an automatic technique for verifying finite state concurrent systems. A rapid solution for the model checking… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2005
Highly Cited
2005
This paper presents an on-the-fly and symbolic technique for efficiently checking timed automata emptiness. It is symbolic… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
2004
2004
The complementation problem for nondeterministic word automata has numerous applications in formal verification. In particular… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2003
Highly Cited
2003
We present a new procedure for the translation of propositional linear-time temporal logic (LTL) formulas to equivalent… (More)
  • figure 1
Is this relevant?
Highly Cited
2000
Highly Cited
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)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
Highly Cited
1987
Highly Cited
1987
The problem of complementing Biichi automata arises when developing decision procedures for temporal logics of programs… (More)
  • figure 1
  • figure 2
Is this relevant?