2026-07-22T17:54:08Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:2302 2024-03-06T10:33:15Z ddc:004 open_access

Mediating for Reduction (on Minimizing Alternating Büchi Automata) Abdulla, Parosh A. Chen, Yu-Fang Holik, Lukas Vojnar, Tomas Alternating Automata Buchi Automata Automata Minimization Buchi Automata Complementation Simulation Preorder forward and backward simulation mediated equivalence We propose a new approach for minimizing alternating B\"uchi automata (ABA). The approach is based on the so called \emph{mediated equivalence} on states of ABA, which is the maximal equivalence contained in the so called \emph{mediated preorder}. Two states $p$ and $q$ can be related by the mediated preorder if there is a~\emph{mediator} (mediating state) which forward simulates $p$ and backward simulates $q$. Under some further conditions, letting a computation on some word jump from $q$ to $p$ (due to they get collapsed) preserves the language as the automaton can anyway already accept the word without jumps by runs through the mediator. We further show how the mediated equivalence can be computed efficiently. Finally, we show that, compared to the standard forward simulation equivalence, the mediated equivalence can yield much more significant reductions when applied within the process of complementing B\"uchi automata where ABA are used as an intermediate model. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Parosh A. Abdulla and Yu-Fang Chen and Lukas Holik and Tomas Vojnar 2009 Is Part Of LIPIcs, Volume 4, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (2009) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.FSTTCS.2009.2302 urn:nbn:de:0030-drops-23027 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2009.2302 eng https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode