Deadlock analysis of unbounded process networks

DOI10.1016/J.IC.2016.03.004MaRDI QIDQ729810zbMATH OpenOpenAlexFDO

Authors Naoki Kobayashi, Cosimo Laneve

Publication date 22 December 2016

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ic.2016.03.004

zbMATH Keywords

type systemsbehavioural typesprocess calculifixpointsdeadlockslam programs

Mathematics Subject Classification ID

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

Recommendations

• Deadlock analysis of unbounded process networks
• scientific article; zbMATH DE number 3926230
• Deadlock analysis in networks of communicating processes
• Deadlock Analysis of Parameterized-Chain Networks
• Deadlock detection-oriented unfolding of unbounded Petri nets
• Petri-net-based deadlock analysis of process algebra programs
• scientific article; zbMATH DE number 176516
• Characterization of deadlocks in irregular networks
• Deadlock analysis and control using Petri net decomposition techniques
• On the undecidability of deadlock detection in families of nets

Cites work

• scientific article; zbMATH DE number 1748069 (Why is no real title available?)
• A New Type System for Deadlock-Free Processes
• A calculus of communicating systems
• A calculus of mobile processes. II
• A type system for lock-free processes
• Conversation types
• Deadlock analysis of unbounded process networks
• Deadlock and lock freedom in the linear \(\pi\)-calculus
• Deadlock checking by data race detection
• Deadlock detection in linear recursive programs
• Type systems for concurrent programs.
• Type-based information flow analysis for the \(\pi\)-calculus

Cited in

(14)

• Deadlock freedom for asynchronous and cyclic process networks
• Static deadlock prevention in dynamically configured communication networks
• Deadlock analysis in networks of communicating processes
• Static trace-based deadlock analysis for synchronous Mini-Go
• scientific article; zbMATH DE number 3926230 (Why is no real title available?)
• Deadlock Analysis of Wait-Notify Coordination
• On the undecidability of deadlock detection in families of nets
• A lightweight deadlock analysis for programs with threads and reentrant locks
• Deadlock detection for actor-based coroutines
• Comparing type systems for deadlock freedom
• Deadlock analysis of unbounded process networks
• Asynchronous session-based concurrency: deadlock-freedom in cyclic process networks
• Deadlock detection in linear recursive programs
• Fair termination of multiparty sessions

Describes a project that uses

Uses Software

• TyPiCal

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 Q729810)