Constrained Dynamic Tree Networks

2018-09-03T11:02:23Z (GMT) by Matthew Hague Vincent Penelle
We generalise Constrained Dynamic Pushdown Networks, introduced by Bouajjani\et al, to Constrained Dynamic Tree Networks.
In this model, we have trees of processes which may monitor their children.
We allow the processes to be defined by any computation model for which the alternating reachability problem is decidable.
We address the problem of symbolic reachability analysis for this model. More precisely, we consider the problem of computing an effective representation of their reachability
sets using finite state automata.
We show that backwards reachability sets starting from regular sets of configurations are always regular.
We provide an algorithm for computing backwards reachability sets using tree automata.