Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
LIPIcs Leibniz International Proceedings in Informatics Mediating for Reduction
 

Summary: LIPIcs Leibniz International Proceedings in Informatics
Mediating for Reduction
(on Minimizing Alternating Bšuchi Automata)
Parosh A. Abdulla1
, Yu-Fang Chen1
, LukŽas HolŽik2
, TomŽas Vojnar2
1 University of Uppsala, Sweden,
{parosh,yu-fang.chen}@it.uu.se
2 FIT, Brno University of Technology, Czech Republic,
{holik,vojnar}@fit.vutbr.cz
ABSTRACT. We propose a new approach for minimizing alternating Bšuchi automata (ABA). The
approach is based on the so called mediated equivalence on states of ABA, which is the maximal equiv-
alence 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 equiv-
alence, the mediated equivalence can yield much more significant reductions when applied within

  

Source: Abdulla, Parosh Aziz - Department of Information Technology, Uppsala Universitet

 

Collections: Computer Technologies and Information Sciences