Forwards- and backwards-reachability for cooperating multi-pushdown systems
From MaRDI portal
Publication:6546604
DOI10.1007/978-3-031-43587-4_23MaRDI QIDQ6546604FDOQ6546604
Authors: Chris Köcher, Dietrich Kuske 
Publication date: 29 May 2024
Recommendations
- Backwards-reachability for cooperating multi-pushdown systems
- Reachability of multistack pushdown systems with scope-bounded matching relations
- Reachability problem for weak multi-pushdown automata
- Reachability of scope-bounded multistack pushdown systems
- Reachability problem for weak multi-pushdown automata
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Combinatorial problems of commutation and rearrangements
- Notes on finite asynchronous automata
- Reachability analysis of communicating pushdown systems
- Reachability analysis of pushdown automata: Application to model-checking
- Tools and Algorithms for the Construction and Analysis of Systems
- Automata Studies. (AM-34)
- CONCUR 2005 – Concurrency Theory
- A Generic Approach to the Static Analysis of Concurrent Programs with Procedures
- Controllers for the verification of communicating multi-pushdown systems
- Verifying communicating multi-pushdown systems via split-width
- Multi-buffer simulations: decidability and complexity
- Reachability of scope-bounded multistack pushdown systems
- Emptiness of ordered multi-pushdown automata is 2ETIME-complete
- The complexity of model checking multi-stack systems
Cited In (1)
This page was built for publication: Forwards- and backwards-reachability for cooperating multi-pushdown systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6546604)
