Forwards- and backwards-reachability for cooperating multi-pushdown systems

DOI10.1007/978-3-031-43587-4_23MaRDI QIDQ6546604FDO

Authors Chris Köcher, Dietrich Kuske

Publication date 29 May 2024

zbMATH Keywords

reachabilitydistributed systemformal verificationpushdown automaton

Mathematics Subject Classification ID

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)

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

Cites work

• A Generic Approach to the Static Analysis of Concurrent Programs with Procedures
• Automata Studies. (AM-34)
• CONCUR 2005 – Concurrency Theory
• Combinatorial problems of commutation and rearrangements
• Controllers for the verification of communicating multi-pushdown systems
• Emptiness of ordered multi-pushdown automata is 2ETIME-complete
• Multi-buffer simulations: decidability and complexity
• Notes on finite asynchronous automata
• Reachability analysis of communicating pushdown systems
• Reachability analysis of pushdown automata: Application to model-checking
• Reachability of scope-bounded multistack pushdown systems
• The complexity of model checking multi-stack systems
• Tools and Algorithms for the Construction and Analysis of Systems
• Verifying communicating multi-pushdown systems via split-width

Cited in

(1)

• Backwards-reachability for cooperating multi-pushdown systems

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)