Checking a Mutex Algorithm in a Process Algebra with Fairness

DOI10.1007/11817949_10MaRDI QIDQ5756622zbMATH OpenOpenAlexFDO

Authors Maria Rita Di Berardini, Flavio Corradini, Walter Vogler

Publication date 4 September 2007

Published in CONCUR 2006 – Concurrency Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11817949_10

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Liveness of a mutex algorithm in a fair process algebra
• Time and Fairness in a Process Algebra with Non-blocking Reading
• scientific article; zbMATH DE number 7317251
• scientific article; zbMATH DE number 1863165
• Bounded fairness

Cited in

(6)

• Liveness of a mutex algorithm in a fair process algebra
• ACTLW -- an action-based computation tree logic with unless operator
• Time and Fairness in a Process Algebra with Non-blocking Reading
• scientific article; zbMATH DE number 1863165 (Why is no real title available?)
• scientific article; zbMATH DE number 7317251 (Why is no real title available?)
• Theoretical Aspects of Computing – ICTAC 2005

This page was built for publication: Checking a Mutex Algorithm in a Process Algebra with Fairness

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5756622)