# Linear temporal logic to Büchi automaton

## Papers overview

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

2015

2015

- CONCUR
- 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

- SPIN
- 2014

LTL to Büchi automata (BA) translators are traditionally optimized to produce automata with a small number of states or a small… (More)

Is this relevant?

Highly Cited

2012

Highly Cited

2012

- TACAS
- 2012

We introduce improvements in the algorithm by Gastin and Oddoux translating LTL formulae into Büchi automata via very weak… (More)

Is this relevant?

Highly Cited

2006

Highly Cited

2006

- PODS
- 2006

We propose a novel approach to the classical view update problem. The view update problem arises from the fact that modifications… (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- TACAS
- 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)

Is this relevant?

2002

2002

- International Journal on Software Tools for…
- 2002

Model checkers are often used to verify critical systems, and thus a lot of effort should be put on ensuring their reliability… (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- CAV
- 2001

We present an algorithm to generate Büchi automata from LTL formulae. This algorithm generates a very weak alternating co-Büchi… (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- ASE
- 2001

This paper presents an approach to checking a running program against Linear Temporal Logic (LTL) specifications. LTL is a widely… (More)

Is this relevant?

Highly Cited

1999

Highly Cited

1999

- SODA
- 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