Degeneralization Algorithm for Generation of Büchi Automata Based on Contented Situation

Abstract EN

We present on-the-fly degeneralization algorithm used to transform generalized Büchi automata (GBA) into Büchi Automata (BA) different from the standard degeneralization algorithm.

Contented situation, which is used to record what acceptance conditions are satisfiable during expanding LTL formulae, is attached to the states and transitions in the BA.

In order to get the deterministic BA, the Shannon expansion is used recursively when we expand LTL formulae by applying the tableau rules.

On-the-fly degeneralization algorithm is carried out in each step of the expansion of LTL formulae.

Ordered binary decision diagrams are used to represent the BA and simplify LTL formulae.

The temporary automata are stored as syntax directed acyclic graph in order to save storage space.

These ideas are implemented in a conversion algorithm used to build a property automaton corresponding to the given LTL formulae.

We compare our method to previous work and show that it is more efficient for four sets of random formulae generated by LBTT.