Optimizing Büchi Automata

By Kousha Etessami, Gerard J. Holzmann. International Conference on Concurrency Theory, 2000

400 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Theory and Mathematics

View Paper: https://www.semanticscholar.org/paper/1c5574bb60204c87d643b6fa768a3b086b5c0d29

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

1. Patrick Lincoln
2. Paul Gastin
3. Denis Oddoux
4. Calin A. Belta
5. Marius Kloetzer

In Computational Theory and Mathematics

1. Patrick Lincoln
2. Paul Gastin
3. Denis Oddoux
4. Calin A. Belta
5. Marius Kloetzer

Citations in the corpus

• Efficient Büchi Automata from LTL Formulae (2000, neutral): “Etessami and Holzmann [8] have independently developed a similar approach.”
• The Maude 2.0 System (2003, methodology): “The negated LTL formula is converted to negative normal form and heuristically simplified by a set of Maude equations, mostly derived from the simplification rules in [14,23].”
• Fast LTL to Büchi Automata Translation (2001, methodology): “Spin’s algorithm was improved by [1] (LTL2AUT), [2] (EQLTL), [10] (Wring): these papers did not modify the basis of the algorithm, but improved it using”