94 search results - page 6 / 19 » Reaching and Distinguishing States of Distributed Systems |
ATAL
2005
Springer
14 years 1 months ago
2005
Springer
Groups of collaborative agents within organizations need to create group awareness in order to act as a single entity. The notion of collective belief, which has been used extensi...
IFM
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We present a formal development in Event-B of a distributed topology discovery algorithm. Distributed topology discovery is at the core of several routing algorithms and ...
QEST
2006
IEEE
14 years 1 months ago
2006
IEEE
We consider discrete infinite-state Markov chains which contain an eager finite attractor. A finite attractor is a finite subset of states that is eventually reached with prob...
CONCUR
2001
Springer
14 years 4 days ago
2001
Springer
We study the maximal reachability probability problem for infinite-state systems featuring both nondeterministic and probabilistic choice. The problem involves the computation of ...
SSS
2007
Springer
14 years 1 months ago
2007
Springer
Consider a network of processes that exchange messages via FIFO communication channels. Each process chooses a subset of its neighboring processes to be its successors. Furthermore...