Backwards-reachability for cooperating multi-pushdown systems

DOI10.1016/J.JCSS.2024.103601MaRDI QIDQ6655673zbMATH OpenFDO

Authors Chris Köcher, Dietrich Kuske

Publication date 27 December 2024

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JCSS.2024.103601

zbMATH Keywords

distributed systemformal verificationpushdown automatonreachability

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

• Forwards- and 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)
• Combinatorial problems of commutation and rearrangements
• CONCUR 2005 – Concurrency Theory
• Controllers for the verification of communicating multi-pushdown systems
• Emptiness of ordered multi-pushdown automata is 2ETIME-complete
• 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. Pro
• Forwards- and backwards-reachability for cooperating multi-pushdown systems
• scientific article; zbMATH DE number 1670780 (Why is no real title available?)
• 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

(4)

• Forwards- and backwards-reachability for cooperating multi-pushdown systems
• Disjointness, inclusion, and regularity of -rational trace languages (extended abstract)
• The theory of reachability of trace-pushdown systems
• Reachability in trace-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)