We improve on an existing [PA Abdulla, J. Högberg, L. Kaati, Bisimulation minimization of
tree automata, International Journal of Foundations of Computer Science 18 (4)(2007) 699 …

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 …

The subject of this dissertation is the construction of two taxonomies and a toolkit of
algorithms solving two different but closely related problems from the domain of regular tree …

We present Ultimate TreeAutomizer, a solver for satisfiability of sets of constrained Horn
clauses. Constrained Horn clauses (CHC) are a fragment of first order logic with attractive …

We improve an existing bisimulation minimisation algorithm for tree automata by introducing
backward and forward bisimulations and developing minimisation algorithms for them …

We extend an algorithm by Paige and Tarjan that solves the coarsest stable refinement
problem to the domain of trees. The algorithm is used to minimize nondeterministic tree …

We generalise existing forward and backward bisimulation minimisation algorithms for tree
automata to weighted tree automata. The obtained algorithms work for all semirings and …

We propose a sampling-based motion planning algorithm for systems with complex
dynamics and temporal logic specifications allowing to tackle sophisticated missions. By …

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 …

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 …