Přístupnostní navigace
E-přihláška
Vyhledávání Vyhledat Zavřít
Detail publikace
HOLÍK, L. VOJNAR, T. ABDULLA, P. BOUAJJANI, A. KAATI, L.
Originální název
Computing Simulations over Tree Automata (Efficient Techniques for Reducing Tree Automata)
Typ
článek ve sborníku mimo WoS a Scopus
Jazyk
angličtina
Originální abstrakt
We address the problem of computing simulation relations over treeautomata. In particular, we consider downward and upward simulations ontree automata, which are, loosely speaking, analogous to forward andbackward relations over word automata. We provide simple and efficientalgorithms for computing these relations based on a reduction to theproblem of computing simulations on labelled transition systems.Furthermore, we show that downward and upward relations can be combinedto get relations compatible with the tree language equivalence, whichcan subsequently be used for an efficient size reduction ofnondeterministic tree automata. This is of a very high interest, forinstance, for symbolic verification methods such as regular modelchecking, which use tree automata to represent infinite sets ofreachable configurations. We provide experimental results showing theefficiency of our algorithms on examples of tree automata taken fromregular model checking computations.
Klíčová slova
tree automata, simulation relation, nondeterministic tree automata, reductionm, language preservation
Autoři
HOLÍK, L.; VOJNAR, T.; ABDULLA, P.; BOUAJJANI, A.; KAATI, L.
Rok RIV
2008
Vydáno
31. 3. 2008
Nakladatel
Springer Verlag
Místo
Berlin
ISBN
978-3-540-78799-0
Kniha
Tools and Algorithms for the Construction and Analysis of Systems
Edice
Lecture Notes in Computer Science
Strany od
93
Strany do
108
Strany počet
16
BibTex
@inproceedings{BUT30753, author="Lukáš {Holík} and Tomáš {Vojnar} and Parosh {Abdulla} and Ahmed {Bouajjani} and Lisa {Kaati}", title="Computing Simulations over Tree Automata (Efficient Techniques for Reducing Tree Automata)", booktitle="Tools and Algorithms for the Construction and Analysis of Systems", year="2008", series="Lecture Notes in Computer Science", volume="4963", pages="93--108", publisher="Springer Verlag", address="Berlin", isbn="978-3-540-78799-0" }