Zprostředkování pro redukci (Za minimalizací alternujících automatů)

Mediating for Reduction (On Minimizing Alternating Büchi Automata)

article in a collection out of WoS and Scopus

Czech

Navrhli jsme novou metodu redukce alternujících Büchi automatů slučováním stavů ekvivalentních podle podle nové relace, takzvane zprostředkované (mediated) ekvivalenece. Zprostředkovaná ekvivalece je kombinací dopředné a zpětné simulace. Efektivitu metody jsme otestovali na experiementech s alternujícími automaty vznikajícími v rámci komplementace Büchi automatů.

We propose a new approach for minimizing alternating Büchi automata (ABA). The approach is based on the so called mediated equivalence on states of ABA, which is the maximal equivalence contained in the so called mediated preorder. Two states p and q can be related by the mediated preorder if there is a 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üchi automata where ABA are used as an intermediate model.

alternating automata, Büchi automata, reduction, simulation

HOLÍK, L.; VOJNAR, T.; ABDULLA, P.; CHEN, Y.

2009

15. 12. 2009

Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik

Wadern

978-3-939897-13-2

IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (2009)

LIPIcs, sv. 4

1

12

12

http://www.fit.vutbr.cz/~holik/pub/FSTTCS09.pdf