| Abdulla, P., A., Bouajjani, A., Holík, L., Kaati, L., Vojnar, T.: Composed Bisimulation for Tree Automata, In: Implementation and Application of Automata, Berlin, DE, Springer, 2008, p. 212-222, ISBN 978-3-540-70843-8 | | Publication language: | english |
|---|
| Original title: | Composed Bisimulation for Tree Automata |
|---|
| Title (cs): | Kombinovaná bisimulace pro stromové automaty |
|---|
| Pages: | 212-222 |
|---|
| Proceedings: | Implementation and Application of Automata |
|---|
| Conference: | 13th International Conference on Implementation and Application of Automata -- CIAA'08 |
|---|
| Series: | LNCS 5148 |
|---|
| Place: | Berlin, DE |
|---|
| Year: | 2008 |
|---|
| ISBN: | 978-3-540-70843-8 |
|---|
| Publisher: | Springer Verlag |
|---|
| Keywords |
|---|
| finite tree automata, bisimulation, size reduction |
| Annotation |
|---|
| We address the problem of reducing the size of (nondeterministic,
bottom-up) tree automata using suitable, language-preserving
equivalences on the states of the automata. In particular, we propose
the so-called composed bisimulation as a new language preserving
equivalence. Composed bisimulation is defined in terms of two different
relations, namely upward and downward bisimulation. Moreover, we
provide simple and efficient algorithms for computing composed
bisimulation based on a reduction to the problem of computing
bisimulations on (labeled) transition systems. The proposal of composed
bisimulation is motivated by an attempt to obtain an equivalence that
can provide better reductions than what currently known
bisimulation-based approaches can offer, but which is not significantly
more difficult to compute (and hence stays below the computational
requirements of simulation-based reductions). The experimental results
we present in the paper show that our composed bisimulation meets such
requirements, and hence provides users of tree automata with a finer
way to resolve the trade-off between the available degree of reduction
and its cost. |
| BibTeX: |
|---|
@INPROCEEDINGS{
author = {A. Parosh Abdulla and Ahmed Bouajjani and Lukáš Holík and
Lisa Kaati and Tomáš Vojnar},
title = {Composed Bisimulation for Tree Automata},
pages = {212--222},
booktitle = {Implementation and Application of Automata},
series = {LNCS 5148},
year = {2008},
location = {Berlin, DE},
publisher = {Springer Verlag},
ISBN = {978-3-540-70843-8},
language = {english},
url = {http://www.fit.vutbr.cz/research/view_pub.php?id=8671}
} |
|