24 search results - page 5 / 5 » Fair Synchronous Transition Systems and Their Liveness Proof... |
FORTE
2009
13 years 3 months ago
2009
We consider the following problem: For a system consisting of two components, the behavior of one component is known as well as the desired global behavior. What should be the beha...
SPAA
2009
ACM
14 years 5 months ago
2009
ACM
Dining philosophers is a classic scheduling problem for local mutual exclusion on arbitrary conflict graphs. We establish necessary conditions to solve wait-free dining under even...
LICS
1994
IEEE
13 years 9 months ago
1994
IEEE
The modal mu-calculus is an expressive logic that can be used to specify safety and liveness properties of concurrent systems represented as labeled transition systems (LTSs). We ...
ICFEM
2009
Springer
13 years 11 months ago
2009
Springer
Fault-tolerant (FT) distributed protocols (such as group membership, consensus, etc.) represent fundamental building blocks for many practical systems, e.g., the Google File System...