Generalized Büchi automaton

In formal verification, the model checking method needs to obtain an automaton from a LTL formula that specifies the desired program property.

Note that there may be no accepting sets, in which case any infinite run trivially satisfies this property.

It was introduced by Gerth et al.[3] Formally, a labeled generalized Büchi automaton is a tuple A = (Q, Σ, L, Δ,Q0,

Note that there may be no accepting sets, in which case any infinite run trivially satisfies this property.

To obtain the non-labeled version, the labels are moved from the nodes to the incoming transitions.