Fairness of components in system computations

DOI10.1016/j.tcs.2006.02.011zbMath1092.68065OpenAlexW2032553573MaRDI QIDQ2491632

Flavio Corradini, Walter Vogler, Maria Rita Di Berardini

Publication date: 29 May 2006

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.02.011

zbMATH Keywords

timed process algebrasprocess algebrasliveness propertiesfairness of actionsfairness of componentsworst-case efficiency

Mathematics Subject Classification ID

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

Related Items (2)

Ensuring liveness properties of distributed systems: open problems ⋮ Liveness of a mutex algorithm in a fair process algebra

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bisimulation on speed: Worst-case efficiency
• A fair calculus of communicating systems
• Comparing the worst-case efficiency of asynchronous systems with PAFAS
• Efficiency of asynchronous systems, read arcs, and the MUTEX-problem
• Weak and strong fairness in CCS
• CONCUR 2003 - Concurrency Theory

This page was built for publication: Fairness of components in system computations