@inproceedings{d7b65e8be7074df7896fe465eb965797,
title = "Transient Fault Detectors",
abstract = "In this paper we present failure detectors that detect transient failures, i.e. corruption of the system state without corrupting the program of the processors. We distinguish task which is the problem to solve, from implementation which is the algorithm that solve the problem. A task is specified as a desired output of the distributed system. The mechanism used to produce this output is not a concern of the task but a concern of the implementation. In addition we are able to classify both the distance locality and the history locality property of tasks. The distance locality is related to the diameter of the system configuration that a failure detector has to maintain in order to detect a transient fault. The history locality is related to the number of consecutive system configurations that a failure detector has to maintain in order to detect a transient fault.",
author = "Joffroy Beauquier and Sylvie Dela{\"e}t and Shlomi Dolev and S{\'e}bastien Tixeuil",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1998.; 12th International Symposium on Distributed Computing, DISC 1998 ; Conference date: 24-09-1998 Through 26-09-1998",
year = "1998",
month = jan,
day = "1",
doi = "10.1007/bfb0056474",
language = "English",
isbn = "3540650660",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "62--74",
editor = "Shay Kutten",
booktitle = "Distributed Computing - 12th International Symposium, DISC 1998, Proceedings",
address = "Germany",
}