Games on Multi-stack Pushdown Systems

DOI10.1007/978-3-540-92687-0_27zbMath1211.68238OpenAlexW1595576901MaRDI QIDQ3605543

Anil K. Seth

Publication date: 24 February 2009

Published in: Logical Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-92687-0_27

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (4)

Reachability of scope-bounded multistack pushdown systems ⋮ Emptiness of Ordered Multi-Pushdown Automata is 2ETIME-Complete ⋮ Visibly pushdown modular games ⋮ Games on Higher Order Multi-stack Pushdown Systems

Cites Work

• Unnamed Item
• Unnamed Item
• Note on winning positions on pushdown games with \(\omega\)-regular conditions
• Pushdown processes: Games and model-checking
• Reducing Concurrent Analysis Under a Context Bound to Sequential Analysis
• An Infinite Automaton Characterization of Double Exponential Time
• The Language Theory of Bounded Context-Switching
• Context-Bounded Analysis of Concurrent Queue Systems
• Tools and Algorithms for the Construction and Analysis of Systems
• Computer Aided Verification

This page was built for publication: Games on Multi-stack Pushdown Systems