Deadlock freedom for asynchronous and cyclic process networks

DOI10.4204/EPTCS.347.3MaRDI QIDQ6649541zbMATH OpenFDO

Authors Bas van den Heuvel, Jorge A. Pérez

Publication date 6 December 2024

Full work available at URL https://doi.org/10.4204/EPTCS.347.3

Mathematics Subject Classification ID

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

Recommendations

• Asynchronous session-based concurrency: deadlock-freedom in cyclic process networks
• scientific article; zbMATH DE number 1088044
• Types for deadlock-free higher-order programs
• Comparing type systems for deadlock freedom
• Deadlock and lock freedom in the linear -calculus

Cites work

• A calculus of mobile processes. I
• A message-passing interpretation of adjoint logic
• A new linear logic for deadlock-free session-typed processes
• A New Type System for Deadlock-Free Processes
• Comparing deadlock-free session typed processes
• Corecursion and non-divergence in session-typed processes
• Cut reduction in linear logic as asynchronous session-typed communication
• Deadlock analysis of unbounded process networks
• Deadlock and lock freedom in the linear -calculus
• Fundamentals of session types
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• Linear logic
• Linearity, control effects, and behavioral types
• Manifest deadlock-freedom for shared session types
• On the expressiveness of internal mobility in name-passing calculi
• Propositions as sessions
• Session types as intuitionistic linear propositions
• Types and programing languages

Cited in

(2)

• Asynchronous session-based concurrency: deadlock-freedom in cyclic process networks
• Comparing session type systems derived from linear logic

This page was built for publication: Deadlock freedom for asynchronous and cyclic process networks

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