Resilience of General Interactive Tasks


We give a necessary and sufficient combinatorial condition that determines t-resilience of general interactive tasks operating in asynchronous environments, with respect to randomized error free protocols. Each general interactive task is associated with an infinite directed acyclic graph, whose nodes represent states of the distributed system. We show that… (More)
DOI: 10.1145/197917.198085


Cite this paper

@inproceedings{Chor1994ResilienceOG, title={Resilience of General Interactive Tasks}, author={Benny Chor and Lee-Bath Nelson}, booktitle={PODC}, year={1994} }