Sciweavers

WDAG
2000
Springer
97views Algorithms» more  WDAG 2000»
14 years 2 months ago
Objects Shared by Byzantine Processes
Work to date on algorithms for message-passing systems has explored a wide variety of types of faults, but corresponding work on shared memory systems has usually assumed that only...
Dahlia Malkhi, Michael Merritt, Michael K. Reiter,...
IPPS
2009
IEEE
14 years 5 months ago
A fusion-based approach for tolerating faults in finite state machines
Given a set of n different deterministic finite state machines (DFSMs) modeling a distributed system, we examine the problem of tolerating f crash or Byzantine faults in such a ...
Vinit A. Ogale, Bharath Balasubramanian, Vijay K. ...