Fast reductions for ω-automaton


Revision as of 17:18, 3 February 2022 by Bot (talk | contribs) (Created page with "{{CSIReport | authors = Jérôme Dubois | title = Fast reductions for ω-automaton | year = 2022 | number = 2202 | abstract = The <math>\omega</math>-automata, capable of mode...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)


The -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.