An implementation of mutual inclusion

R.R. Hoogerwoord

doi:10.1016/0020-0190(86)90046-3

An implementation of mutual inclusion

R.R. Hoogerwoord

Algorithms

Research output: Contribution to journal › Article › Academic › peer-review

11 Citations (Scopus)

1 Downloads (Pure)

Abstract

We consider the parallel composition of two cyclic programs. The interaction of these programs consists of a form of synchronisation sometimes referred to as ‘mutual inclusion’. For a given implementation of this synchronisation by means of semaphore operations, we prove the correctness of the programs and we prove the absence of the danger of deadlock.

Original language	English
Pages (from-to)	77-80
Journal	Information Processing Letters
Volume	23
Issue number	2
DOIs	https://doi.org/10.1016/0020-0190(86)90046-3
Publication status	Published - 1986

Access to Document

10.1016/0020-0190(86)90046-3

Cite this

@article{5944e508fe644dee964d420cf6a74b2b,

title = "An implementation of mutual inclusion",

abstract = "We consider the parallel composition of two cyclic programs. The interaction of these programs consists of a form of synchronisation sometimes referred to as {\textquoteleft}mutual inclusion{\textquoteright}. For a given implementation of this synchronisation by means of semaphore operations, we prove the correctness of the programs and we prove the absence of the danger of deadlock.",

author = "R.R. Hoogerwoord",

year = "1986",

doi = "10.1016/0020-0190(86)90046-3",

language = "English",

volume = "23",

pages = "77--80",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier B.V.",

number = "2",

}

TY - JOUR

T1 - An implementation of mutual inclusion

AU - Hoogerwoord, R.R.

PY - 1986

Y1 - 1986

N2 - We consider the parallel composition of two cyclic programs. The interaction of these programs consists of a form of synchronisation sometimes referred to as ‘mutual inclusion’. For a given implementation of this synchronisation by means of semaphore operations, we prove the correctness of the programs and we prove the absence of the danger of deadlock.

AB - We consider the parallel composition of two cyclic programs. The interaction of these programs consists of a form of synchronisation sometimes referred to as ‘mutual inclusion’. For a given implementation of this synchronisation by means of semaphore operations, we prove the correctness of the programs and we prove the absence of the danger of deadlock.

U2 - 10.1016/0020-0190(86)90046-3

DO - 10.1016/0020-0190(86)90046-3

M3 - Article

SN - 0020-0190

VL - 23

SP - 77

EP - 80

JO - Information Processing Letters

JF - Information Processing Letters

IS - 2

ER -

An implementation of mutual inclusion

Abstract

Access to Document

Fingerprint

Cite this