Deadlock analysis in networks of communicating processes
- 1 December 1991
- journal article
- Published by Springer Nature in Distributed Computing
- Vol. 4 (4) , 209-230
- https://doi.org/10.1007/bf01784721
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Reasoning about systems with many processesJournal of the ACM, 1992
- A structural induction theorem for processesPublished by Association for Computing Machinery (ACM) ,1989
- An improved failures model for communicating processesPublished by Springer Nature ,1985
- Logics and Models of Concurrent SystemsPublished by Springer Nature ,1985
- A Theory of Communicating Sequential ProcessesJournal of the ACM, 1984
- A Proof System for Communicating Sequential ProcessesACM Transactions on Programming Languages and Systems, 1980
- Deadlock absence proofs for networks of communicating processesInformation Processing Letters, 1979
- Communicating sequential processesCommunications of the ACM, 1978
- Guarded commands, nondeterminacy and formal derivation of programsCommunications of the ACM, 1975
- Some Deadlock Properties of Computer SystemsACM Computing Surveys, 1972