Tighter reachability criteria for deadlock-freedom analysis

DOI10.1007/978-3-319-48989-6_3zbMath1427.68179OpenAlexW2529513861MaRDI QIDQ2281624

Pedro Antonino, A. W. Roscoe, Thomas Gibson-Robinson

Publication date: 3 January 2020

Full work available at URL: https://doi.org/10.1007/978-3-319-48989-6_3

Mathematics Subject Classification ID

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

Related Items (4)

Efficient verification of concurrent systems using local-analysis-based approximations and SAT solving ⋮ The Automatic Detection of Token Structures and Invariants Using SAT Checking ⋮ Mitigating Multi-target Attacks in Hash-Based Signatures ⋮ Discovering and correcting a deadlock in a channel implementation

This page was built for publication: Tighter reachability criteria for deadlock-freedom analysis