Correctness and concurrent complexity of the black-white bakery algorithm (Q736464)

From MaRDI portal
Revision as of 11:20, 4 April 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q59436837, #quickstatements; #temporary_batch_1712201099914)
scientific article
Language Label Description Also known as
English
Correctness and concurrent complexity of the black-white bakery algorithm
scientific article

    Statements

    title
    Correctness and concurrent complexity of the black-white bakery algorithm (English)
    0 references
    author
    Wim H. Hesselink
    0 references
    publication date
    4 August 2016
    0 references
    zbMATH Keywords
    mutual exclusion
    0 references
    FCFS
    0 references
    concurrent complexity
    0 references
    UNITY
    0 references
    describes a project that uses
    PVS
    0 references
    UNITY
    0 references

    Identifiers

    zbMATH DE Number
    6609073
    0 references
    OpenAlex ID
    W2322615457
    0 references
    Wikidata QID
    Q59436837
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q736464&oldid=33235607"
    Powered by MediaWiki