Reachability Problems in Piecewise FIFO Systems

DOI10.1145/2071368.2071375zbMath1351.68161MaRDI QIDQ2946655

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

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

verification; infinite-state systems; reachability analysis; FIFO systems

Mathematics Subject Classification ID

68Q60: Specification and verification (program logics, model checking, etc.)

68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)

Related Items

Verifying Deadlock-Freedom of Communication Fabrics