Royal Holloway, University of London
Browse
main.pdf (463.04 kB)

Constrained Dynamic Tree Networks

Download (463.04 kB)
Version 2 2018-09-03, 11:02
Version 1 2018-07-23, 13:47
journal contribution
posted on 2018-09-03, 11:02 authored by Matthew HagueMatthew 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.

Funding

Engineering and Physical Sciences Research Council [EP/K009907/1]

History

Date Created

July 2018

File Formats

PDF

Usage metrics

    Computer Science

    Licence

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC