| Revista: | Computación y sistemas |
| Base de datos: | |
| Número de sistema: | 000560701 |
| ISSN: | 1405-5546 |
| Autores: | Armenta Segura, Jorge1 Ledent, Jeremy2 Rajsbaum, Sergio1 |
| Instituciones: | 1Universidad Nacional Autónoma de México, Insituto de Matemáticas, México 2University of Strathclyde, Reino Unido |
| Año: | 2022 |
| Periodo: | Abr-Jun |
| Volumen: | 26 |
| Número: | 2 |
| Paginación: | 769-785 |
| País: | México |
| Idioma: | Inglés |
| Resumen en inglés | We investigate the two agents approximate agreement problem in a dynamic network in which topology may change unpredictably, and where consensus is not solvable. It is known that the number of rounds necessary and sufficient to guarantee that the two agents output values 1/k3 away from each other is k. We distil ideas from previous papers to provide a self-contained, elementary introduction, that explains this result from the epistemic logic perspective. |
| Keyword: | Distributed algorithm, Approximate consensus, Fault-tolerance, Epistemic logic |
| Texto completo: | Texto completo (Ver HTML) Texto completo (Ver PDF) |
