Modelling Mutual Exclusion in a Process Algebra with Time-outs

Research output: Contribution to journalArticlepeer-review

Abstract / Description of output

I show that in a standard process algebra extended with time-outs one can correctly model mutual exclusion in such a way that starvation-freedom holds without assuming fairness or justness, even when one makes the problem more challenging by assuming memory accesses to be atomic. This can be achieved only when dropping the requirement of speed independence.
Original languageEnglish
Article number105079
Pages (from-to)1-36
Number of pages36
JournalInformation and Computation
Volume294
DOIs
Publication statusPublished - 25 Aug 2023

Fingerprint

Dive into the research topics of 'Modelling Mutual Exclusion in a Process Algebra with Time-outs'. Together they form a unique fingerprint.

Cite this