Composed Bisimulation for Tree Automata
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 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.
KeywordsModel Check Transition System Transition Rule Good Reduction Tree Automaton
Unable to display preview. Download preview PDF.
- 1.Abdulla, P., Bouajjani, A., Holík, L., Kaati, L., Vojnar, T.: Composed Bisimulation for Tree Automata. Technical Report FIT-TR-2008-04, FIT, Brno Uni. of Technology, Czech Republic (2008)Google Scholar
- 2.Abdulla, P., Bouajjani, A., Holik, L., Kaati, L., Vojnar, T.: Computing Simulations over Tree Automata: Efficient Techniques for Reducing Tree Automata. In: Proc. of TACAS 2008. LNCS. Springer, Heidelberg (2008)Google Scholar
- 4.Abdulla, P., Holík, L., Kaati, L., Vojnar, T.: A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata. Technical Report FIT-TR-2008-05, FIT, Brno Uni. of Technology, Czech Republic (2008)Google Scholar
- 7.Bouajjani, A., Habermehl, P., Rogalewicz, A., Vojnar, T.: Abstract Regular Tree Model Checking. In: Proc. of INFINITY 2005; ENTCS 149(1) (published, 2006) Google Scholar
- 10.Henzinger, M., Henzinger, T., Kopke, P.: Computing Simulations on Finite and Infinite Graphs. In: Proc. of FOCS 1995. IEEE, Los Alamitos (1995)Google Scholar
- 12.Klarlund, N., Møller, A.: MONA Version 1.4 User Manual, BRICS, Department of Computer Science, University of Aarhus, Denmark (2001)Google Scholar
- 14.Ranzato, F., Tapparo, F.: A New Efficient Simulation Equivalence Algorithm. In: Proc. of LICS 2007. IEEE CS, Los Alamitos (2007)Google Scholar