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

DOI10.1007/978-3-540-95891-8_20MaRDI QIDQ3599073zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Checking a Mutex Algorithm in a Process Algebra with Fairness
• Liveness of a mutex algorithm in a fair process algebra
• Relating fairness and timing in process algebras.
• scientific article; zbMATH DE number 1876862
• Fairness of actions in system computations

Cites work

• Automated analysis of mutual exclusion algorithms using CCS
• Checking a Mutex Algorithm in a Process Algebra with Fairness
• Comparing the worst-case efficiency of asynchronous systems with PAFAS
• Contextual nets
• Efficiency of asynchronous systems, read arcs, and the MUTEX-problem
• Fairness of actions in system computations
• scientific article; zbMATH DE number 4082934 (Why is no real title available?)
• Measuring the performance of asynchronous systems with PAFAS
• Time and Fairness in a Process Algebra with Non-blocking Reading
• Timed Petri Nets and Timed Automata: On the Discriminating Power of Zeno Sequences
• Weak and strong fairness in CCS

Cited in

(10)

• Liveness of a mutex algorithm in a fair process algebra
• Ensuring liveness properties of distributed systems: open problems
• CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions
• Time and Fairness in a Process Algebra with Non-blocking Reading
• Analysing mutual exclusion using process algebra with signals
• Checking a Mutex Algorithm in a Process Algebra with Fairness
• Modelling mutual exclusion in a process algebra with time-outs
• Just testing
• A lean-congruence format for ep-bisimilarity
• Just verification of mutual exclusion algorithms

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

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