147 search results - page 7 / 30 » Polynomial Fairness and Liveness |
ICALP
1994
Springer
14 years 1 months ago
1994
Springer
When provingthe correctness of algorithmsin distributed systems, one generally considers safety conditions and liveness conditions. The Input Output I O automaton model and its ti...
NOSSDAV
2009
Springer
14 years 4 months ago
2009
Springer
Data dissemination in decentralized networks is often realized by using some form of swarming technique. Swarming enables nodes to gather dynamically in order to fulfill a certai...
EMSOFT
2006
Springer
14 years 1 months ago
2006
Springer
We present a deadlock avoidance algorithm for distributed systems that guarantees liveness. Deadlock avoidance in distributed systems is a hard problem and general solutions are c...
CORR
2002
Springer
13 years 9 months ago
2002
Springer
Abstract--In heterogeneous networks such as today's Internet, the differentiated services architecture promises to provide QoS guarantees through scalable service differentiat...
POPL
2005
ACM
14 years 10 months ago
2005
ACM
on Predicate Abstraction and Fair Termination Andreas Podelski Andrey Rybalchenko Max-Planck-Institut f?ur Informatik Saarbr?ucken, Germany Predicate abstraction is the basis of m...