A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata

Authors:
Parosh A. Abdulla;Lukáš Holík;Lisa Kaati;Tomáš Vojnar
Affiliations:
Department of Information Technology, University of Uppsala, Uppsala, Sweden;Faculty of Information Technology, Brno University of Technology, Brno, Czech Republic;Department of Information Technology, University of Uppsala, Uppsala, Sweden;Faculty of Information Technology, Brno University of Technology, Brno, Czech Republic
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2009

Citing 9
Cited 0

Three partition refinement algorithms

SIAM Journal on Computing
Regular Tree Model Checking

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Extrapolating Tree Transformations

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
A New Efficient Simulation Equivalence Algorithm

LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Bisimulation relations for weighted automata

Theoretical Computer Science
Abstract Regular Tree Model Checking

Electronic Notes in Theoretical Computer Science (ENTCS)
Bisimulation minimisation for weighted tree automata

DLT'07 Proceedings of the 11th international conference on Developments in language theory
Backward and forward bisimulation minimisation of tree automata

CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Bisimulation minimization of tree automata

CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we address the problem of reducing the size of nondeterministic (bottom-up) tree automata. We propose a uniform framework that allows for combining various upward and downward bisimulation and simulation relations in order to obtain a language-preserving combined relation suitable for reducing tree automata without a need to determinise them. The framework generalises and extends several previous works and provides a broad spectrum of different relations yielding a possibility of a fine choice between the amount of reduction and the computational demands. We, moreover, provide a significantly improved way of computing the various combined (bi-)simulation relations. We analyse properties of the considered relations both theoretically as well as through a series of experiments.