The complexity of bounded context switching with dynamic thread creation

Dynamic networks of concurrent pushdown systems (DCPS) are a theoretical model for multi-threaded recursive programs with shared global state and dynamical creation of threads. The (global) state reachability problem for DCPS is undecidable in general, but Atig et al. (2009) showed that it becomes d...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2020-11
Hauptverfasser:	Baumann, Pascal, Majumdar, Rupak, Thinniyam, Ramanathan S, Zetzsche, Georg
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Formal Languages and Automata Theory Computer Science - Logic in Computer Science Computer Science - Programming Languages Context Finite state machines Hardness Lower bounds Petri nets Procedure calls Switches
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!