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