A CCS-based investigation of deadlock in a multi-process electronic mail system

DOI10.1007/BF01212487zbMath0784.68013OpenAlexW2083355315MaRDI QIDQ688829

Gordon Brebner

Publication date: 6 December 1993

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01212487

zbMATH Keywords

deadlockcalculus of communicating systemsconcurrency workbenchmultiprocess software

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Theory of software (68N99)

Related Items (2)

\(\text{DELFIN}^+\): an efficient deadlock detection tool for CCS processes ⋮ Using heuristic search for finding deadlocks in concurrent systems

Cites Work

• Results on the propositional \(\mu\)-calculus
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A CCS-based investigation of deadlock in a multi-process electronic mail system