Liveness of a mutex algorithm in a fair process algebra (Q1015393): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Fairness of components in system computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fairness of actions in system computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Liveness of a mutex algorithm in a fair process algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measuring the performance of asynchronous systems with PAFAS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparing the worst-case efficiency of asynchronous systems with PAFAS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak and strong fairness in CCS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bisimulation on speed: Worst-case efficiency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3126969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiency of asynchronous systems, read arcs, and the MUTEX-problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated analysis of mutual exclusion algorithms using CCS / rank
 
Normal rank

Revision as of 12:56, 1 July 2024

scientific article
Language Label Description Also known as
English
Liveness of a mutex algorithm in a fair process algebra
scientific article

    Statements

    Identifiers