Renaming and the weakest family of failure detectors (Q1938384)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Renaming and the weakest family of failure detectors |
scientific article; zbMATH DE number 6134283
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Renaming and the weakest family of failure detectors |
scientific article; zbMATH DE number 6134283 |
Statements
Renaming and the weakest family of failure detectors (English)
0 references
4 February 2013
0 references
This paper focuses on a specific environment that describes runs in which at most \(n\) out of \(m\) processes participate. In this environment the authors determine a weakest family of failure detectors for the task of renaming (modulo a special class of failure detectors).
0 references
renaming
0 references
weakest failure detector
0 references
