Modelling Mutual Exclusion in a Process Algebra with Time-outs

Rob van Glabbeek

doi:10.1016/j.ic.2023.105079

Modelling Mutual Exclusion in a Process Algebra with Time-outs

Research output: Contribution to journal › Article › peer-review

Abstract

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 language	English
Article number	105079
Pages (from-to)	1-36
Number of pages	36
Journal	Information and Computation
Volume	294
DOIs	https://doi.org/10.1016/j.ic.2023.105079
Publication status	Published - 25 Aug 2023

Access to Document

10.1016/j.ic.2023.105079Licence: Creative Commons: Attribution (CC-BY)

Modelling mutual exclusion_VAN GLABBEEK_DOA03082023_VOR_CC BYFinal published version, 1.24 MBLicence: Creative Commons: Attribution (CC-BY)

https://www.sciencedirect.com/science/article/pii/S0890540123000822?via%3DihubLicence: Creative Commons: Attribution (CC-BY)

Cite this

@article{c427f10beb15431cb6dd3791abe443c9,

title = "Modelling Mutual Exclusion in a Process Algebra with Time-outs",

abstract = "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.",

author = "{van Glabbeek}, Rob",

note = "Funding Information: Supported by Royal Society Wolfson Fellowship RSWF﹨R1﹨221008. Publisher Copyright: {\textcopyright} 2023 The Author(s)",

year = "2023",

month = aug,

day = "25",

doi = "10.1016/j.ic.2023.105079",

language = "English",

volume = "294",

pages = "1--36",

journal = "Information and Computation",

issn = "0890-5401",

publisher = "Elsevier",

}

TY - JOUR

T1 - Modelling Mutual Exclusion in a Process Algebra with Time-outs

AU - van Glabbeek, Rob

PY - 2023/8/25

Y1 - 2023/8/25

N2 - 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.

AB - 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.

U2 - 10.1016/j.ic.2023.105079

DO - 10.1016/j.ic.2023.105079

M3 - Article

SN - 0890-5401

VL - 294

SP - 1

EP - 36

JO - Information and Computation

JF - Information and Computation

M1 - 105079

ER -

Modelling Mutual Exclusion in a Process Algebra with Time-outs

Abstract

Access to Document

Fingerprint

Cite this