LTL to Büchi Automata Translation: Fast and More Deterministic

摘要

We introduce improvements in the algorithm by Gastin and Oddoux translatingLTL formulae into B"uchi automata via very weak alternating co-B"uchiautomata and generalized B"uchi automata. Several improvements are based onspecific properties of any formula where each branch of its syntax treecontains at least one eventually operator and at least one always operator.These changes usually result in faster translations and smaller automata. Otherimprovements reduce non-determinism in the produced automata. In fact, wemodified all the steps of the original algorithm and its implementation knownas LTL2BA. Experimental results show that our modifications are realimprovements. Their implementations within an LTL2BA translation made LTL2BAvery competitive with the current version of SPOT, sometimes outperforming itsubstantially.