# Fast reductions for ω-automaton

### From LRDE

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

## Abstract

The ${\displaystyle \omega }$-automata, capable of modeling infinite behavior, are used in numerous domains including model checking. The algorithms used are in general very costly. For this reason, we want to reduce the automata size while preserving the recognized language by applying numerous reductions. This report, in the continuation of the previous one, we will presents some improvements to the simulation based reduction and a new algorithm: the path refinement.