Reachability problems in piecewise FIFO systems

DOI10.1145/2071368.2071375MaRDI QIDQ2946655zbMATH OpenOpenAlexFDO

Authors N. Ghafari, Arie Gurfinkel, Nils Klarlund, Richard Trefler

Publication date 17 September 2015

Published in ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2071368.2071375

zbMATH Keywords

FIFO systemsinfinite-state systemsreachability analysisverification

Mathematics Subject Classification ID

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

• Verification, Model Checking, and Abstract Interpretation
• Regularity results for FIFO channels
• Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
• An introduction to FIFO nets - monogeneous nets: a subclass of FIFO nets
• Reachability analysis of communicating pushdown systems

Cited in

(10)

• An introduction to FIFO nets - monogeneous nets: a subclass of FIFO nets
• Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
• Multiparty half-duplex systems and synchronous communications
• Verifying deadlock-freedom of communication fabrics
• Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
• scientific article; zbMATH DE number 7471708 (Why is no real title available?)
• Verification of Flat FIFO Systems
• Verification, Model Checking, and Abstract Interpretation
• Towards generalised half-duplex systems
• Reachability problems on reliable and lossy queue automata

This page was built for publication: Reachability problems in piecewise FIFO systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2946655)