Fairness of actions in system computations

DOI10.1007/s00236-006-0011-2zbMath1097.68087OpenAlexW2101725378MaRDI QIDQ2502272

Walter Vogler, Flavio Corradini, Maria Rita Di Berardini

Publication date: 12 September 2006

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/179

Mathematics Subject Classification ID

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

Related Items (6)

Modelling mutual exclusion in a process algebra with time-outs ⋮ Keep it fair: equivalence and composition ⋮ Ensuring liveness properties of distributed systems: open problems ⋮ Time and Fairness in a Process Algebra with Non-blocking Reading ⋮ Liveness of a mutex algorithm in a fair process algebra ⋮ CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Modular construction and partial order semantics of Petri nets
• Testing equivalences for processes
• 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
• Efficiency of asynchronous systems and read arcs in petri nets
• CONCUR 2003 - Concurrency Theory
• Fast asynchronous systems in dense time

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