Sciweavers

94 search results - page 2 / 19
» Reaching and Distinguishing States of Distributed Systems
Sort
View
POPL
2005
ACM
14 years 8 months ago
Transactors: a programming model for maintaining globally consistent distributed state in unreliable environments
We introduce transactors, a fault-tolerant programming model for composing loosely-coupled distributed components running in an unreliable environment such as the internet into sy...
John Field, Carlos A. Varela
EUROPAR
2009
Springer
14 years 2 months ago
Steady-State for Batches of Identical Task Trees
Abstract In this paper, we focus on the problem of scheduling batches of identical task graphs on a heterogeneous platform, when the task graph consists in a tree. We rely on stead...
Sékou Diakité, Loris Marchal, Jean-M...
CONCUR
2007
Springer
13 years 11 months ago
Decidability Results for Well-Structured Transition Systems with Auxiliary Storage
Abstract. We consider the problem of verifying the safety of wellstructured transition systems (WSTS) with auxiliary storage. WSTSs with storage are automata that have (possibly) i...
Rohit Chadha, Mahesh Viswanathan
HYBRID
2007
Springer
14 years 1 months ago
Symbolic Analysis for GSMP Models with One Stateful Clock
We consider the problem of verifying reachability properties of stochastic real-time systems modeled as generalized semi-Markov processes (GSMPs). The standard simulation-based tec...
Mikhail Bernadsky, Rajeev Alur
AINA
2007
IEEE
13 years 11 months ago
Considering Runtime Restrictions in Self-Healing Distributed Systems
Hardware failures in autonomous and distributed software systems create the need for self-healing activities. This work addresses the problem of redeploying software components af...
Christoph Danne, Viktor Dück, Benjamin Kl&oum...