# Parity Games on Bounded Phase Multi-pushdown Systems

@inproceedings{Atig2017ParityGO, title={Parity Games on Bounded Phase Multi-pushdown Systems}, author={Mohamed Faouzi Atig and Ahmed Bouajjani and K. Narayan Kumar and Prakash Saivasan}, booktitle={NETYS}, year={2017} }

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.

## 3 Citations

On the Complexity of Multi-Pushdown Games

- Computer ScienceFSTTCS
- 2020

This work shows that k-context games are b-EXPTIME-complete, where b = max{k−2, 1}.

Round-Bounded Control of Parameterized Systems

- Computer Science, MathematicsATVA
- 2018

This paper extends the approach to round-bounded verification to a game-based setting, which allows one to solve synthesis and control problems and constitutes a further step towards a theory of languages over infinite alphabets.

Context-bounded verification of liveness properties for multithreaded shared-memory programs

- Computer ScienceProc. ACM Program. Lang.
- 2021

An extension of vector addition systems with states with states, called VASS with balloons (VASSB), is introduced as an intermediate model; it is an infinite-state model of independent interest and shows that context bounded fair termination reduces to fair termination for VASSB.

## References

SHOWING 1-10 OF 13 REFERENCES

Games on Multi-stack Pushdown Systems

- Computer ScienceLFCS
- 2009

This paper shows that parity games over bounded phase multi-stack pushdown systems are effectively solvable and winning strategy in these games can be effectively synthesized.

Pushdown Processes: Games and Model Checking

- Computer ScienceCAV
- 1996

It is shown that the model checking problem for push-down automata and the propositional μ-calculus is DEXPTIME-complete and there is a winning strategy which is realized by a pushdown process.

Note on winning positions on pushdown games with [omega]-regular conditions

- MathematicsInf. Process. Lett.
- 2003

Tree Automata, Mu-Calculus and Determinacy (Extended Abstract)

- Mathematics, Computer ScienceFOCS 1991
- 1991

The propositional Mu-Calculus is equivalent in expressive power to finite automata on infinite trees and provides a radically simplified, alternative proof of Rabin's complementation lemma for tree automata, which is the heart of one of the deepest decidability results.

A Robust Class of Context-Sensitive Languages

- Computer Science22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007)
- 2007

MVPLs are an extension of visibly pushdown languages that captures noncontext free behaviors, and has applications in analyzing abstractions of multithreaded recursive programs, signifi- cantly enlarging the search space that can be explored for them.

The complexity of decision problems in automata theory and logic.

- Computer Science
- 1974

This paper is intended to demonstrate the efforts of the Massachusetts Institute of Technology’s graduate students to improve the quality of their teaching and research.

An Automata-Theoretic Approach to Infinite-State Systems

- Computer ScienceEssays in Memory of Amir Pnueli
- 2010

An automata-theoretic framework for reasoning about infinite-state sequential systems based on the observation that states of such systems can be viewed as nodes in an infinite tree, and transitions between states can be simulated by finite-state automata.

On the Specification of Higher Dimensional Automata

- Computer ScienceElectron. Notes Theor. Comput. Sci.
- 2002

Reducing Context-Bounded Concurrent Reachability to Sequential Reachability

- Computer ScienceCAV
- 2009

A translation from concurrent programs to sequential programs is given that reduces the context-bounded reachability problem in the concurrent program to a reachabilityproblem in the sequential one and is implemented in the setting of concurrent recursive programs with finite data domains.