Forwards- and backwards-reachability for cooperating multi-pushdown systems
From MaRDI portal
Publication:6546604
DOI10.1007/978-3-031-43587-4_23MaRDI QIDQ6546604
Publication date: 29 May 2024
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
- Multi-buffer simulations: decidability and complexity
- Reachability of scope-bounded multistack pushdown systems
- The complexity of model checking multi-stack systems
- Combinatorial problems of commutation and rearrangements
- Controllers for the Verification of Communicating Multi-pushdown Systems
- Automata Studies. (AM-34)
- Verifying Communicating Multi-pushdown Systems via Split-Width
- Notes on finite asynchronous automata
- Emptiness of Ordered Multi-Pushdown Automata is 2ETIME-Complete
- A Generic Approach to the Static Analysis of Concurrent Programs with Procedures
- Tools and Algorithms for the Construction and Analysis of Systems
- Reachability Analysis of Communicating Pushdown Systems
- CONCUR 2005 – Concurrency Theory
- Reachability analysis of pushdown automata: Application to model-checking
Related Items (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)
