Sciweavers

732 search results - page 113 / 147
» A Formal Model of Provenance in Distributed Systems
Sort
View
DC
2007
14 years 9 months ago
Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings
We present a randomizedself-stabilizing leaderelection protocol and a randomizedself-stabilizing token circulation protocol under an arbitrary scheduler on anonymous and unidirect...
Joffroy Beauquier, Maria Gradinariu, Colette Johne...
ENTCS
2007
104views more  ENTCS 2007»
14 years 9 months ago
Exogenous Probabilistic Computation Tree Logic
We define a logic EpCTL for reasoning about the evolution of probabilistic systems. System states correspond to probability distributions over classical states and the system evo...
Pedro Baltazar, Paulo Mateus, Rajagopal Nagarajan,...
SIGSOFT
2002
ACM
15 years 10 months ago
Secure systems development based on the common criteria: the PalME project
Security is a very important issue in information processing, especially in open network environments like the Internet. The Common Criteria (CC) is the standard requirements cata...
Monika Vetterling, Guido Wimmel, Alexander K. Wi&s...
WWW
2005
ACM
15 years 10 months ago
TrustGuard: countering vulnerabilities in reputation management for decentralized overlay networks
Reputation systems have been popular in estimating the trustworthiness and predicting the future behavior of nodes in a large-scale distributed system where nodes may transact wit...
Mudhakar Srivatsa, Li Xiong, Ling Liu
SIROCCO
2008
14 years 11 months ago
Sharpness: A Tight Condition for Scalability
: A distributed system is scalable if the rate at which it completes its computation and communication tasks does not depend on its size. As an example, the scalability of a peer-t...
Augustin Chaintreau