Commutative grammars: the complexity of uniform word problems
Information and Control
Petri nets, commutative context-free grammars, and basic parallel processes
Fundamenta Informaticae
Information and Computation - Special issue on EXPRESS 1997
The regular viewpoint on PA-processes
Theoretical Computer Science
The Book of Traces
Reachability Analysis of Pushdown Automata: Application to Model-Checking
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Regular symbolic analysis of dynamic networks of pushdown systems
CONCUR 2005 - Concurrency Theory
Reachability is decidable for weakly extended process rewrite systems
Information and Computation
Partially-Commutative Context-Free Processes
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Reducing concurrent analysis under a context bound to sequential analysis
Formal Methods in System Design
On the Reachability Problem for Dynamic Networks of Concurrent Pushdown Systems
RP '09 Proceedings of the 3rd International Workshop on Reachability Problems
From multi to single stack automata
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Partially-commutative context-free processes: Expressibility and tractability
Information and Computation
Reasoning about threads with bounded lock chains
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Analysis of recursively parallel programs
POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Context-Bounded model checking of concurrent software
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Reasoning about threads communicating via locks
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Reachability under contextual locking
TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Safety verification of asynchronous pushdown systems with shaped stacks
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
| Hi-index | 0.00 |
This paper is about reachability analysis in a restricted subclass of multi-pushdown automata: we assume that the control states of an automaton are partially ordered, and all transitions of an automaton go downwards with respect to the order. We prove decidability of the reachability problem, and computability of the backward reachability set. As the main contribution, we identify relevant subclasses where the reachability problem becomes NP-complete. This matches the complexity of the same problem for communication-free vector addition systems (known also as commutative context-free graphs), a special case of stateless multi-pushdown automata.