Simulation-Based Simplification of omega-Automata
Fritz, Carsten We analyze simulation relations as heuristics for the simplification of omega-automata, i.e., of finite automata working on infinite strings. Our focus is on alternating omega-automata, especially automata resulting from LTL formulas, as is important in model checking. We introduce direct, delayed, and fair simulation for alternating Büchi automata (ABA), and simulation quotient constructions for ABA. Our simulations are compatible with the st...