Backwards-reachability for cooperating multi-pushdown systems
From MaRDI portal
Publication:6655673
DOI10.1016/j.jcss.2024.103601MaRDI QIDQ6655673
Publication date: 27 December 2024
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
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
- Title not available (Why is that?)
- Multi-buffer simulations: decidability and complexity
- Formal techniques for distributed systems. Joint IFIP WG 6.1 international conference, FMOODS/FORTE 2013, held as part of the 8th international federated conference on distributed computing techniques, DisCo Tec 2013, Florence, Italy, June 3--5, 2013. Proceedings
- Reachability of scope-bounded multistack pushdown systems
- The complexity of model checking multi-stack systems
- Combinatorial problems of commutation and rearrangements
- A generic approach to the static analysis of concurrent programs with procedures
- 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
- 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
- Forwards- and backwards-reachability for cooperating multi-pushdown systems
This page was built for publication: 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 Q6655673)
