An iterative and starvation-free solution for a general class of distributed control problems based on interaction primitives
From MaRDI portal
Publication:1838827
DOI10.1016/0304-3975(83)90127-5zbMath0511.68013MaRDI QIDQ1838827
Publication date: 1983
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(83)90127-5
distributed processes; loosely coupled systems; dining philosophers' problem; interaction systems; local excitement relations; starvation-freeness
68N25: Theory of operating systems
Related Items
Fairness and conspiracies, A self-stabilizing algorithm for strong fairness, TTL : a formalism to describe local and global properties of distributed systems
Cites Work