Efficient Büchi Automata from LTL Formulae

By F. Somenzi, Roderick Bloem. International Conference on Computer Aided Verification, 2000

373 citations recorded by the source corpus.

How researchers see this paper

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

Linear Time Logic Control of Discrete-Time Linear Systems (2006, neutral): “Since this translation is well documented in the literature we point the interested reader to the survey [61] and to the algorithms described in [62] and [63] for more details.”
The Maude 2.0 System (2003, methodology): “Rather than the classical tableaux construction [17], we use a newer technique proposed in [16] based on very weak alternating automata to which we add some strongly connected component optimizations adapted from those in [23].”
Fast LTL to Büchi Automata Translation (2001, methodology): “64 Paul Gastin and Denis Oddoux Wring is an algorithm presented in [ 10 ].”