Time and Fairness in a Process Algebra with Non-blocking Reading

DOI10.1007/978-3-540-95891-8_20zbMath1206.68213OpenAlexW2167703610MaRDI QIDQ3599073

Maria Rita Di Berardini, Flavio Corradini, Walter Vogler

Publication date: 3 February 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-95891-8_20

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 ⋮ Just testing ⋮ Unnamed Item ⋮ Ensuring liveness properties of distributed systems: open problems ⋮ Time and Fairness in a Process Algebra with Non-blocking Reading ⋮ 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
• Automated analysis of mutual exclusion algorithms using CCS
• Comparing the worst-case efficiency of asynchronous systems with PAFAS
• Efficiency of asynchronous systems, read arcs, and the MUTEX-problem
• Measuring the performance of asynchronous systems with PAFAS
• Weak and strong fairness in CCS
• Contextual nets
• Fairness of actions in system computations
• Timed Petri Nets and Timed Automata: On the Discriminating Power of Zeno Sequences
• Time and Fairness in a Process Algebra with Non-blocking Reading
• Checking a Mutex Algorithm in a Process Algebra with Fairness

This page was built for publication: Time and Fairness in a Process Algebra with Non-blocking Reading