Faculty of Information Technology, BUT

Publication Details

Computing Simulations over Tree Automata (Efficient Techniques for Reducing Tree Automata)

ABDULLA Parosh A., BOUAJJANI Ahmed, HOLÍK Lukáš, KAATI Lisa and VOJNAR Tomáš. Computing Simulations over Tree Automata (Efficient Techniques for Reducing Tree Automata). In: Tools and Algorithms for the Construction and Analysis of Systems. Lecture Notes in Computer Science, vol. 4963. Berlin: Springer Verlag, 2008, pp. 93-108. ISBN 978-3-540-78799-0.
Czech title
Výpočet simulací nad stromovými automaty (Efektivní techniky pro redukci stromových automatů)
Type
conference paper
Language
english
Authors
Abdulla Parosh A. (Uppsala)
Bouajjani Ahmed (UPAR7)
Holík Lukáš, Mgr., Ph.D. (DITS FIT BUT)
Kaati Lisa (Uppsala)
Vojnar Tomáš, prof. Ing., Ph.D. (DITS FIT BUT)
Keywords
tree automata, simulation relation, nondeterministic tree automata, reductionm, language preservation
Abstract
We address the problem of computing simulation relations over tree automata. In particular, we consider downward and upward simulations on tree automata, which are, loosely speaking, analogous to forward and backward relations over word automata. We provide simple and efficient algorithms for computing these relations based on a reduction to the problem of computing simulations on labelled transition systems. Furthermore, we show that downward and upward relations can be combined to get relations compatible with the tree language equivalence, which can subsequently be used for an efficient size reduction of nondeterministic tree automata. This is of a very high interest, for instance, for symbolic verification methods such as regular model checking, which use tree automata to represent infinite sets of reachable configurations. We provide experimental results showing the efficiency of our algorithms on examples of tree automata taken from regular model checking computations.
Published
2008
Pages
93-108
Proceedings
Tools and Algorithms for the Construction and Analysis of Systems
Series
Lecture Notes in Computer Science
Volume
4963
Conference
European Joint Conferences on Theory and Practice of Software -- ETAPS'08 (TACAS'08, FoSSaCS'08), Budapešť, HU
ISBN
978-3-540-78799-0
Publisher
Springer Verlag
Place
Berlin, DE
BibTeX
@INPROCEEDINGS{FITPUB8575,
   author = "A. Parosh Abdulla and Ahmed Bouajjani and Luk\'{a}\v{s} Hol\'{i}k and Lisa Kaati and Tom\'{a}\v{s} Vojnar",
   title = "Computing Simulations over Tree Automata (Efficient Techniques for Reducing Tree Automata)",
   pages = "93--108",
   booktitle = "Tools and Algorithms for the Construction and Analysis of Systems",
   series = "Lecture Notes in Computer Science",
   volume = 4963,
   year = 2008,
   location = "Berlin, DE",
   publisher = "Springer Verlag",
   ISBN = "978-3-540-78799-0",
   language = "english",
   url = "https://www.fit.vut.cz/research/publication/8575"
}
Back to top