Deadlock analysis of unbounded process networks

DOI10.1007/978-3-662-44584-6_6zbMATH Open1417.68128OpenAlexW196808440MaRDI QIDQ3190109FDOQ3190109

Authors: 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

Recommendations

• Deadlock analysis of unbounded process networks
• scientific article; zbMATH DE number 3926230
• Deadlock analysis in networks of communicating processes
• Deadlock detection in linear recursive programs
• The pursuit of deadlock freedom

Mathematics Subject Classification ID

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

Cited In (11)

• Title not available (Why is that?)
• On the undecidability of deadlock detection in families of nets
• Title not available (Why is that?)
• Title not available (Why is that?)
• Comparing type systems for deadlock freedom
• A lightweight deadlock analysis for programs with threads and reentrant locks
• Deadlock analysis of unbounded process networks
• Conflation confers concurrency
• Deadlock Analysis of Wait-Notify Coordination
• Deadlock analysis in networks of communicating processes
• Deadlock detection in linear recursive programs

This page was built for publication: Deadlock analysis of unbounded process networks

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