Deadlock Analysis of Unbounded Process Networks

DOI10.1007/978-3-662-44584-6_6zbMath1417.68128OpenAlexW196808440MaRDI QIDQ3190109

Elena Giachino, Naoki Kobayashi, Cosimo Laneve

Publication date: 15 September 2014

Published in: CONCUR 2014 – Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01091749/file/mfd.pdf

Mathematics Subject Classification ID

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

Related Items (5)

Conflation Confers Concurrency ⋮ Comparing type systems for deadlock freedom ⋮ A lightweight deadlock analysis for programs with threads and reentrant locks ⋮ Deadlock analysis of unbounded process networks ⋮ Prioritise the best variation

This page was built for publication: Deadlock Analysis of Unbounded Process Networks