Fairness of components in system computations
From MaRDI portal
Publication:2491632
Recommendations
Cites work
- A fair calculus of communicating systems
- Bisimulation on speed: Worst-case efficiency
- Comparing the worst-case efficiency of asynchronous systems with PAFAS
- Efficiency of asynchronous systems, read arcs, and the MUTEX-problem
- scientific article; zbMATH DE number 996442 (Why is no real title available?)
- scientific article; zbMATH DE number 4039251 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 1927580 (Why is no real title available?)
- Relating fairness and timing in process algebras.
- Weak and strong fairness in CCS
Cited in
(7)- Liveness of a mutex algorithm in a fair process algebra
- Stepwise development of fair distributed systems
- Ensuring liveness properties of distributed systems: open problems
- On fairness of D0L systems
- Fairness of actions in system computations
- Fairness of components in system computations
- Relating fairness and timing in process algebras.
This page was built for publication: Fairness of components in system computations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2491632)