Liveness of a mutex algorithm in a fair process algebra

In earlier work, we have shown that two variants of weak fairness can be expressed comparatively easily in the timed process algebra PAFAS. To demonstrate the usefulness of these results, we complement work by Walker (Form Asp Comput 1:273–292, 1989) and study the liveness property of Dekker’s mutua...

Full description

Saved in:
Bibliographic Details
Published in:Acta informatica Vol. 46; no. 3; pp. 209 - 235
Main Authors: Corradini, Flavio, Di Berardini, Maria Rita, Vogler, Walter
Format: Journal Article
Language:English
Published: Berlin/Heidelberg Springer-Verlag 01.05.2009
Springer
Springer Nature B.V
Subjects:
Algebra
Algorithmics. Computability. Computer arithmetics
Algorithms
Applied sciences
Case studies
Computer Science
Computer science; control theory; systems
Computer Systems Organization and Communication Networks
Data Structures and Information Theory
Exact sciences and technology
Information Systems and Communication Service
Logics and Meanings of Programs
Mathematics
Miscellaneous
Original Article
Software Engineering/Programming and Operating Systems
Theoretical computing
Theory of Computation
Program Variable
Critical Section
Operational Semantic
Parallel Composition
Initial Process
Process algebra
State space
Mutual exclusion
State space method
Computer theory
ISSN:0001-5903, 1432-0525
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In earlier work, we have shown that two variants of weak fairness can be expressed comparatively easily in the timed process algebra PAFAS. To demonstrate the usefulness of these results, we complement work by Walker (Form Asp Comput 1:273–292, 1989) and study the liveness property of Dekker’s mutual exclusion algorithm within our process algebraic setting. We also present some results that allow to reduce the state space of the PAFAS process representing Dekker’s algorithm, and give some insight into the representation of fair behaviour in PAFAS.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0001-5903
1432-0525
DOI:10.1007/s00236-009-0092-9