Linear temporal logic to Büchi automaton

Known as: LTL to Büchi automata, LTL to Büchi, LTL to Buchi 
In formal verification,finite state model checking needs to compute an equivalent Büchi automaton (BA) to a Linear temporal logic (LTL) formula,i.e… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
The problem of Büchi determinization is a fundamental problem with important applications in reactive synthesis, multi-agent… (More)
Is this relevant?
2014
2014
LTL to Büchi automata (BA) translators are traditionally optimized to produce automata with a small number of states or a small… (More)
  • table 1
  • figure 2
  • figure 1
  • figure 3
  • table 2
Is this relevant?
Highly Cited
2012
Highly Cited
2012
We introduce improvements in the algorithm by Gastin and Oddoux translating LTL formulae into Büchi automata via very weak… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2006
Highly Cited
2006
We propose a novel approach to the classical view update problem. The view update problem arises from the fact that modifications… (More)
  • figure 1
Is this relevant?
Highly Cited
2005
Highly Cited
2005
A Craig interpolant for a mutually inconsistent pair of formulas (A,B) is a formula that is (1) implied by A, (2) inconsistent… (More)
  • figure 1
  • figure 2
Is this relevant?
2002
2002
Model checkers are often used to verify critical systems, and thus a lot of effort should be put on ensuring their reliability… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2001
Highly Cited
2001
We present an algorithm to generate Büchi automata from LTL formulae. This algorithm generates a very weak alternating co-Büchi… (More)
  • figure V
  • figure V
Is this relevant?
Highly Cited
2001
Highly Cited
2001
This paper presents an approach to checking a running program against Linear Temporal Logic (LTL) specifications. LTL is a widely… (More)
  • figure 2
  • figure 1
Is this relevant?
Highly Cited
1999
Highly Cited
1999
We show lower bounds of Q( $ Sort(V)) for the I/Ocomplexity of graph theoretic problems like connected components, biconnected… (More)
Is this relevant?
Highly Cited
1991
Highly Cited
1991
 
Is this relevant?