Parity Games on Bounded Phase Multi-pushdown Systems
نویسندگان
چکیده
In this paper we address the problem of solving parity games over the configuration graphs of bounded phase multi-pushdown systems. A non-elementary decision procedure was proposed for this problem by A. Seth. In this paper, we provide a simple and inductive construction to solve this problem. We also prove a non-elementary lower-bound, answering a question posed by A.Seth.
منابع مشابه
Model checking Branching-Time Properties of Multi-Pushdown Systems is Hard
We address the model checking problem for shared memory concurrent programs modeled as multi-pushdown systems. We consider here boolean programs with a finite number of threads and recursive procedures. It is well-known that the model checking problem is undecidable for this class of programs. In this paper, we investigate the decidability and the complexity of this problem under the assumption...
متن کاملPositional Strategies for Higher-Order Pushdown Parity Games
Higher-order pushdown systems generalize pushdown systems by using higher-order stacks, which are nested stacks of stacks. In this article, we consider parity games defined by higher-order pushdown systems and provide a k-Exptime algorithm to compute finite representations of positional winning strategies for both players for games defined by level-k higher-order pushdown automata. Our result i...
متن کاملSaturation of Concurrent Collapsible Pushdown Systems
Multi-stack pushdown systems are a well-studied model of concurrent computationusing threads with first-order procedure calls. While, in general, reachability is unde-cidable, there are numerous restrictions on stack behaviour that lead to decidability.To model higher-order procedures calls, a generalisation of pushdown stacks called col-lapsible pushdown stacks are required. Re...
متن کاملModel-Checking Bounded Multi-Pushdown Systems
We provide complexity characterizations of model checking multi-pushdown systems. We consider three standard notions for boundedness: context boundedness, phase boundedness and stack ordering. The logical formalism is a linear-time temporal logic extending well-known logic CaRet but dedicated to multi-pushdown systems in which abstract operators are parameterized by stacks. We show that the pro...
متن کاملFormats of Winning Strategies for Six Types of Pushdown Games
The solution of parity games over pushdown graphs (Walukiewicz ’96) was the first step towards an effective theory of infinite-state games. It was shown that winning strategies for pushdown games can be implemented again as pushdown automata. We continue this study and investigate the connection between game presentations and winning strategies in altogether six cases of game arenas, among them...
متن کامل