IEEE.org  |  IEEE Xplore Digital Library  |  IEEE Standards Association  |  Spectrum Online  |  More IEEE Sites

Deadlock-free completely connected networks: towards a π-calculus approach

  • Download Citations
  • Email
  • Print

Access The Full Text

Sign In:Full text access may be available with your subscription

Forgot Username/Password?Athens/Shibboleth Sign In

Crowe, D.  Strain-Clark, P. 
Fac. of Math. & Comput., Open Univ., Milton Keynes 

This paper appears in: Software Engineering Journal
Issue Date: Mar 1996
Volume: 11 Issue: 2
On page(s): 122 - 131
ISSN: 0268-6961
Cited by: 1
INSPEC Accession Number: 5245708
Date of Current Version: 06 August 2002

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

Index Terms

Available to subscribers and IEEE members.

References

Available to subscribers and IEEE members.

Citing Documents

Available to subscribers and IEEE members.


Indexed by Inspec

About IEEE Xplore | Help | Contact Us | Privacy & Security | Site Map | IEEE.org | Nondiscrimination Policy | Terms of Use

© Copyright 2012 IEEE – All Rights Reserved