Starvation-free mutual exclusion with semaphores (Q469360): Difference between revisions

From MaRDI portal
m rollbackEdits.php mass rollback
Tag: Rollback
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00165-011-0219-y / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00165-011-0219-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2035587272 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification of sequential and concurrent programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The existence of refinement mappings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fair mutual exclusion with unfair P and V operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692502 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monitors / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of the “THE”-multiprogramming system / rank
 
Normal rank
Property / cites work
 
Property / cites work: A starvation-free solution to the mutual exclusion problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3738540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Splitting forward simulations to cope with liveness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal extensions to simulate specifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Starvation-free mutual exclusion with semaphores / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3713577 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new solution of Dijkstra's concurrent programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3122691 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3922147 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forward and backward simulations. I. Untimed Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An axiomatic proof technique for parallel programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completeness of ASM Refinement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002512 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00165-011-0219-Y / rank
 
Normal rank

Latest revision as of 19:27, 9 December 2024

scientific article
Language Label Description Also known as
English
Starvation-free mutual exclusion with semaphores
scientific article

    Statements

    Starvation-free mutual exclusion with semaphores (English)
    0 references
    0 references
    0 references
    10 November 2014
    0 references
    semaphore
    0 references
    binary semaphore
    0 references
    mutual exclusion
    0 references
    refinement
    0 references
    starvation freedom
    0 references

    Identifiers