Iterated stack automata and complexity classes
Information and Computation
Journal of the ACM (JACM)
Reachability Analysis of Pushdown Automata: Application to Model-Checking
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
A Robust Class of Context-Sensitive Languages
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
An Infinite Automaton Characterization of Double Exponential Time
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Context-bounded analysis of concurrent queue systems
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
From multi to single stack automata
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
The tree width of auxiliary storage
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Complexity of pattern-based verification for multithreaded programs
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Global reachability in bounded phase multi-stack pushdown systems
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Reachability analysis of communicating pushdown systems
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Synchronisation- and reversal-bounded analysis of multithreaded programs with counters
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Weakly-Synchronized ground tree rewriting
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
MSO decidability of multi-pushdown systems via split-width
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Linear-Time model-checking for multithreaded programs under scope-bounding
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
A temporal logic for multi-threaded programs
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
The Complexity of Model Checking Multi-stack Systems
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
We consider multi-pushdown automata, a multi-stack extension of pushdown automata that comes with a constraint on stack operations: a pop can only be performed on the first non-empty stack (which implies that we assume a linear ordering on the collection of stacks). We show that the emptiness problem for multi-pushdown automata is 2ETIME-complete wrt. the number of stacks. Containment in 2ETIME is shown by translating an automaton into a grammar for which we can check if the generated language is empty. The lower bound is established by simulating the behavior of an alternating Turing machine working in exponential space. We also compare multi-pushdown automata with the model of bounded-phase multi-stack (visibly) pushdown automata.