In a dynamic parametric process every subprocess may spawn arbitrarily many, identical child processes, that may communicate either over global variables, or over local variables that are shared with their parent. We show that reachability for dynamic parametric processes is decidable under mild assumptions. These assumptions are e.g. met if individual processes are realized by pushdown systems, or even higher-order pushdown systems. We also provide algorithms for subclasses of pushdown dynamic parametric processes, with complexity ranging between NP and DEXPTIME.
CITATION STYLE
Muscholl, A., Seidl, H., & Walukiewicz, I. (2017). Reachability for dynamic parametric processes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10145 LNCS, pp. 424–441). Springer Verlag. https://doi.org/10.1007/978-3-319-52234-0_23
Mendeley helps you to discover research relevant for your work.