<div class="csl-bib-body">
<div class="csl-entry">Felber, S. (2026, June 15). <i>Characterizing Stabilizing Consensus Topologically and Epistemically</i> [Presentation]. CELT 2026 : Epistemic logic and topological perspectives on distributed computing, Paris, France. https://doi.org/10.34726/12340</div>
</div>
-
dc.identifier.uri
http://hdl.handle.net/20.500.12708/229099
-
dc.identifier.uri
https://doi.org/10.34726/12340
-
dc.description.abstract
A classic result in the epistemic analysis of distributed systems is the equivalence of terminating consensus and common knowledge. Originally established for simultaneous consensus only, Gonczarowski and Moses have recently shown how to overcome the fundamental ``Halpern-Moses Paradox'', which inevitably arises in systems with timing uncertainties and plagued attempts to establish an analogous result for non-simultaneous consensus.
In this presentation we present results from our recent paper where we build on, and non-trivially extend the latter approach to establish the very first necessary and sufficient epistemic conditions for solving stabilizing consensus. Stabilizing consensus is a non-terminating variant of consensus, where agents may change their decision value finitely often before eventually stabilizing on a common value. Since it is a weaker problem than terminating consensus, stabilizing consensus can be solved in systems where the latter is unsolvable. Our results reveal that, in order to solve stabilizing consensus, agents need to establish a novel notion of common knowledge, called common foreknowledge. Moreover, we show that our epistemic characterizations of both terminating and stabilizing consensus correspond one-to-one to the respective topological characterizations. We achieve this by establishing a novel connection between the knowledge defined on the points of the runs-and-systems framework and the point-set topology defined directly on the set of runs: Dynamic common knowledge, as defined by Gonczarowski and Moses, holds in (and requires) clopen sets and our novel common foreknowledge holds in (and requires) semi-open sets.
en
dc.language.iso
en
-
dc.rights.uri
http://rightsstatements.org/vocab/InC/1.0/
-
dc.subject
epistemic logic
en
dc.subject
topology
en
dc.title
Characterizing Stabilizing Consensus Topologically and Epistemically
en
dc.type
Presentation
en
dc.type
Vortrag
de
dc.rights.license
Urheberrechtsschutz
de
dc.rights.license
In Copyright
en
dc.identifier.doi
10.34726/12340
-
dc.type.category
Presentation
-
tuw.publication.invited
invited
-
tuw.researchTopic.id
C4
-
tuw.researchTopic.id
C5
-
tuw.researchTopic.name
Mathematical and Algorithmic Foundations
-
tuw.researchTopic.name
Computer Science Foundations
-
tuw.researchTopic.value
50
-
tuw.researchTopic.value
50
-
tuw.publication.orgunit
E191-02 - Forschungsbereich Embedded Computing Systems
-
dc.rights.identifier
Urheberrechtsschutz
de
dc.rights.identifier
In Copyright
en
tuw.event.name
CELT 2026 : Epistemic logic and topological perspectives on distributed computing
en
tuw.event.startdate
15-06-2026
-
tuw.event.enddate
18-06-2026
-
tuw.event.online
On Site
-
tuw.event.type
Event for scientific audience
-
tuw.event.place
Paris
-
tuw.event.country
FR
-
tuw.event.presenter
Felber, Stephan
-
wb.sciencebranch
Informatik
-
wb.sciencebranch
Mathematik
-
wb.sciencebranch.oefos
1020
-
wb.sciencebranch.oefos
1010
-
wb.sciencebranch.value
50
-
wb.sciencebranch.value
50
-
item.mimetype
application/pdf
-
item.cerifentitytype
Publications
-
item.grantfulltext
open
-
item.fulltext
with Fulltext
-
item.openairetype
conference presentation
-
item.openairecristype
http://purl.org/coar/resource_type/R60J-J5BD
-
item.languageiso639-1
en
-
item.openaccessfulltext
Open Access
-
crisitem.author.dept
E191-02 - Forschungsbereich Embedded Computing Systems
