DocumentCode
772166
Title
Deadlock-free completely connected networks: towards a π-calculus approach
Author
Crowe, David ; Strain-Clark, Peter
Author_Institution
Fac. of Math. & Comput., Open Univ., Milton Keynes, UK
Volume
11
Issue
2
fYear
1996
fDate
3/1/1996 12:00:00 AM
Firstpage
122
Lastpage
131
Abstract
A very general communication protocol is presented, which enables communication, without danger of deadlock, in a class of networks of asynchronous processes that communicate synchronously, subject to certain fairness constraints on the individual node processes. Deadlock freedom is first proved using the process algebra CCS, but the proof uses the dynamic scoping of channels which is more naturally described by the π-calculus
Keywords
calculus of communicating systems; communicating sequential processes; concurrency control; process algebra; π-calculus; CCS; asynchronous processes; communicating sequential processes; communication protocol; deadlock freedom; deadlock-free completely connected networks; fairness constraints; individual node processes; process algebra;
fLanguage
English
Journal_Title
Software Engineering Journal
Publisher
iet
ISSN
0268-6961
Type
jour
Filename
487424
Link To Document