Optimal Transformations of Muller Conditions
Abstract
In this paper, we are interested in automata over infinite words and infinite duration games, that we view as general transition systems. We study transformations of systems using a Muller condition into ones using a parity condition, extending Zielonka's construction. We introduce the alternating cycle decomposition transformation, and we prove a strong optimality result: for any given deterministic Muller automaton, the obtained parity automaton is minimal both in size and number of priorities among those automata admitting a morphism into the original Muller automaton. We give two applications. The first is an improvement in the process of determinisation of B\"uchi automata into parity automata by Piterman and Schewe. The second is to present characterisations on the possibility of relabelling automata with different acceptance conditions.
Keywords
Cite
@article{arxiv.2011.13041,
title = {Optimal Transformations of Muller Conditions},
author = {Antonio Casares and Thomas Colcombet and Nathanaël Fijalkow},
journal= {arXiv preprint arXiv:2011.13041},
year = {2023}
}
Comments
Paper superseded by the extended version arXiv:2305.04323