Class NormalformDELAConstruction

  • All Implemented Interfaces:
    Function<LabelledFormula,​Automaton<NormalformDELAConstruction.State,​?>>

    public final class NormalformDELAConstruction
    extends Object
    implements Function<LabelledFormula,​Automaton<NormalformDELAConstruction.State,​?>>
    A translation from LTL to deterministic Emerson-Lei automata using the \Delta_2-normalisation procedure. Future Work / TODO: - Use lookahead to find more accepting and rejecting sinks. For this use an exhaustive SCC analysis that is bounded by the lookahead. - Round-Robin Chains that are independent from GF- / FG-subformulas. The heuristic depends on the fact that suspension collapse a SCC to a single state. - Store round-robin chains for beta generation. - Use non-trivial beta generation (using LTL Axioms.)