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, Geometry and Applications

Onderzoeksoutput: Bijdrage aan tijdschrift › Tijdschriftartikel › Academic › peer review

10 Citaten (Scopus)

1 Downloads (Pure)

Samenvatting

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.

Originele taal-2	Engels
Pagina's (van-tot)	77-80
Tijdschrift	Information Processing Letters
Volume	23
Nummer van het tijdschrift	2
DOI's	https://doi.org/10.1016/0020-0190(86)90046-3
Status	Gepubliceerd - 1986

Toegang tot document

10.1016/0020-0190(86)90046-3

Vingerafdruk Duik in de onderzoeksthema's van 'An implementation of mutual inclusion'. Samen vormen ze een unieke vingerafdruk.

Citeer dit

@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",

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

VL - 23

SP - 77

EP - 80

JO - Information Processing Letters

JF - Information Processing Letters

SN - 0020-0190

IS - 2

ER -