Contextual Locking for Dynamic Pushdown Networks

Reachability for Dynamic Parametric Processes

“…One such set could, e.g., specify that all children of a given sub-process have terminated. For dynamic pushdown networks with nested or contextual locking, such kinds of barriers have been considered in [6,13]. It remains as an intriguing question whether or not similar concepts can be handled also for dynamic parametric processes.…”

“…This model combines pushdown threads with dynamic thread creation by means of a spawn operation, while it ignores any exchange of data between threads. Indeed, reachability of dedicated states or even regular sets of configurations stays decidable in this model, if finitely many global locks together with nested locking [12,14] or contextual locking [13] are allowed. Such regular sets allow, e.g., to describe undesirable situations such as concurrent execution of conflicting operations.…”

Model-Checking Linear-Time Properties of Parametrized Asynchronous Shared-Memory Pushdown Systems

“…This model remains decidable even when extended to dynamic pushdown networks [6]. Even reachability of regular sets of configurations is decidable in this model, provided it has a finitely many global locks together with nested locking [28,30] or contextual locking [29]. Regular sets of configurations can compensate to some extent the lack of communication in the model, for example they can describe globally inconsistent configurations.…”