An implementation of mutual inclusion (Q1081297): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(86)90046-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2024302394 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3962450 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An axiomatic proof technique for parallel programs / rank | |||
Normal rank | |||
Latest revision as of 16:10, 17 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An implementation of mutual inclusion |
scientific article |
Statements
An implementation of mutual inclusion (English)
0 references
1986
0 references
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.
0 references
parallel composition of two cyclic programs
0 references
synchronisation
0 references
mutual inclusion
0 references
semaphore operations
0 references
correctness
0 references
deadlock
0 references
