Sciweavers

94 search results - page 3 / 19
» Reaching and Distinguishing States of Distributed Systems
Sort
View
SIROCCO
2008
13 years 9 months ago
Self-stabilizing Cuts in Synchronous Networks
Consider a synchronized distributed system where each node can only observe the state of its neighbors. Such a system is called selfstabilizing if it reaches a stable global state ...
Thomas Sauerwald, Dirk Sudholt
JSW
2007
81views more  JSW 2007»
13 years 7 months ago
Nonblocking Distributed Replication of Versioned Files
— In this paper, we propose a distributed data storage framework that supports unrestricted offline access. The system does not explicitly distinguish between connected and disc...
Lukás Hejtmánek, Ludek Matyska
CDC
2009
IEEE
126views Control Systems» more  CDC 2009»
14 years 11 days ago
Synchronization with partial state feedback on SO(n)
Abstract— In this paper we consider the problem of constructing a distributed feedback law to achieve synchronization for a group of k agents whose states evolve on SO(n) and whi...
Christian Lageman, Alain Sarlette, Rodolphe Sepulc...
CDC
2009
IEEE
162views Control Systems» more  CDC 2009»
14 years 11 days ago
Distributed optimal planning: an approach by weighted automata calculus
— We consider a distributed system modeled as a possibly large network of automata. Planning in this system consists in selecting and organizing actions in order to reach a goal ...
Eric Fabre, Loig Jezequel
CONCUR
2001
Springer
14 years 4 days ago
Compositional Methods for Probabilistic Systems
Abstract. We present a compositional trace-based model for probabilistic systems. The behavior of a system with probabilistic choice is a stochasticprocess, namely, a probability d...
Luca de Alfaro, Thomas A. Henzinger, Ranjit Jhala