Sciweavers

506 search results - page 23 / 102
» Distributing synchronous programs using bounded queues
Sort
View
SPIN
2010
Springer
13 years 6 months ago
Time-Bounded Reachability in Distributed Input/Output Interactive Probabilistic Chains
Abstract. We develop an algorithm to compute timed reachability probabilities for distributed models which are both probabilistic and nondeterministic. To obtain realistic results ...
Georgel Calin, Pepijn Crouzen, Pedro R. D'Argenio,...
HLPPP
1991
13 years 11 months ago
Reasoning About Synchronic Groups
Swarm is a computational model which extends the UNITY model in three important ways: (1) UNITY’s fixed set of variables is replaced by an unbounded set of tuples which are add...
Gruia-Catalin Roman, H. Conrad Cunningham
IEEEARES
2006
IEEE
14 years 1 months ago
Web Service Discovery, Replication, and Synchronization in Ad-Hoc Networks
Mobile ad-hoc networks with their arbitrary topologies are a difficult domain for providing highly available Web services. Since hosts can move unpredictably, finding services a...
Lukasz Juszczyk, Jaroslaw Lazowski, Schahram Dustd...
ENTCS
2008
146views more  ENTCS 2008»
13 years 7 months ago
Probabilistic Abstract Interpretation of Imperative Programs using Truncated Normal Distributions
istic Abstract Interpretation of Imperative Programs using Truncated Normal Distributions Michael J. A. Smith1 ,2 Laboratory for Foundations of Computer Science University of Edinb...
Michael J. A. Smith
PDCAT
2005
Springer
14 years 1 months ago
A New Algorithm to Solve Synchronous Consensus for Dependent Failures
Fault tolerant algorithms are often designed under the t-out-of-n assumption, which is based on the assumption that all processes or components fail independently with equal proba...
Jun Wang, Min Song