Conference paper

 
Abdulla, P., A., Holík, L., Chen, Y., Vojnar, T.: Mediating for Reduction (On Minimizing Alternating Büchi Automata), In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (2009), Wadern, DE, DROPS, 2009, p. 1-12, ISBN 978-3-939897-13-2
Publication language:czech
Original title:Mediating for Reduction (On Minimizing Alternating Büchi Automata)
Title (en):Mediating for Reduction (On Minimizing Alternating Büchi Automata)
Pages:1-12
Proceedings:IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (2009)
Conference:Annual Conference on Foundations of Software Technology and Theoretical Computer Science
Series:LIPIcs, sv. 4
Place:Wadern, DE
Year:2009
ISBN:978-3-939897-13-2
Publisher:Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
URL:http://www.fit.vutbr.cz/~holik/pub/FSTTCS09.pdf [PDF]
Keywords
alternating automata, Büchi automata, reduction, simulation
Annotation
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.
Abstract
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.
BibTeX:
@INPROCEEDINGS{
   author = {A. Parosh Abdulla and Luká¹ Holík and Yu-Fang Chen and Tomá¹
	Vojnar},
   title = {Mediating for Reduction (On Minimizing Alternating Büchi
	Automata)},
   pages = {1--12},
   booktitle = {IARCS Annual Conference on Foundations of Software
	Technology and Theoretical Computer Science (2009)},
   series = {LIPIcs, sv. 4},
   year = {2009},
   location = {Wadern, DE},
   publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
   ISBN = {978-3-939897-13-2},
   language = {czech},
   url = {http://www.fit.vutbr.cz/research/view_pub.php?id=9140}
}