WDAG
2000
Springer
13 years 8 months ago
2000
Springer
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...
IPPS
2009
IEEE
13 years 11 months ago
2009
IEEE
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 ...