H. Attiya & S. Rajsbaum (2002):
The Combinatorial Structure of Wait-Free Solvable Tasks.
SIAM J. Comput. 31(4),
pp. 1286–1313,
doi:10.1137/S0097539797330689.
H. Attiya & J. Welch (2004):
Distributed Computing: Fundamentals, Simulations, and Advanced Topics,
2 edition.
Wiley,
doi:10.1002/0471478210.
A. Baltag, L.S. Moss & S. Solecki (1998):
The logic of common knowledge, public announcements, and private suspicions.
In: TARK VII,
pp. 43–56,
doi:10.1007/978-3-319-20451-2_38.
A. Baltag & B. Renne (2016):
Dynamic Epistemic Logic.
In: The Stanford Encyclopedia of Philosophy, see https://plato.stanford.edu/archives/win2016/entries/dynamic-epistemic/.
Metaphysics Research Lab, Stanford University.
F. Benavides & S. Rajsbaum (2018):
Collapsibility of read/write models using discrete morse theory.
Journal of Applied and Computational Topology,
pp. 1–32,
doi:10.1007/s41468-018-0011-7.
O. Biran, S. Moran & S. Zaks (1990):
A Combinatorial Characterization of the Distributed 1-Solvable Tasks.
J. Algorithms 11(3),
pp. 420–440,
doi:10.1016/0196-6774(90)90020-F.
A. Castañeda, Y. A. Gonczarowski & Y. Moses (2016):
Unbeatable Set Consensus via Topological and Combinatorial Reasoning.
In: PODC.
ACM,
pp. 107–116,
doi:10.1145/2933057.2933120.
A. Castañeda, Y. A. Gonczarowski & Y. Moses (2014):
Unbeatable Consensus.
In: DISC,
LNCS 8784.
Springer,
pp. 91–106,
doi:10.1007/978-3-662-45174-8_7.
C. Dégremont, B. Löwe & A. Witzel (2011):
The Synchronicity of Dynamic Epistemic Logic.
In: TARK XIII.
ACM,
pp. 145–152,
doi:10.1145/2000378.2000395.
H. van Ditmarsch, W. van der Hoek & B. Kooi (2007):
Dynamic Epistemic Logic.
Springer,
doi:10.1007/978-1-4020-5839-4.
M. Fischer, N. A. Lynch & M. S. Paterson (1985):
Impossibility Of Distributed Commit With One Faulty Process.
Journal of the ACM 32(2),
pp. 374–382,
doi:10.1145/3149.214121.
E. Gafni & E. Koutsoupias (1999):
Three-Processor Tasks Are Undecidable.
SIAM J. Comput. 28(3),
pp. 970–983,
doi:10.1137/S0097539796305766.
E. Goubault & S. Rajsbaum (2017):
A simplicial complex model of dynamic epistemic logic for fault-tolerant distributed computing.
Technical Report.
arXiv:1703.11005.
E. Goubault & S. Rajsbaum (2017):
Models of fault-tolerant distributed computation via dynamic epistemic logic.
Technical Report.
arXiv:1704.07883.
J. Havlicek (2000):
Computable obstructions to wait-free computability.
Distributed Computing 13(2),
pp. 59–83,
doi:10.1007/s004460050068.
M. Herlihy, D. Kozlov & S. Rajsbaum (2013):
Distributed Computing Through Combinatorial Topology.
Elsevier-Morgan Kaufmann,
doi:10.1016/C2011-0-07032-1.
M. Herlihy & S. Rajsbaum (1997):
The Decidability of Distributed Decision Tasks.
In: STOC.
ACM,
pp. 589–598,
doi:10.1145/258533.258652.
M. Herlihy & S. Rajsbaum (2012):
Simulations and reductions for colorless tasks.
In: PODC.
ACM,
pp. 253–260,
doi:10.1145/2332432.2332483.
M. P. Herlihy (1988):
Impossibility and Universality Results for Wait-free Synchronization.
In: PODC.
ACM,
pp. 276–290,
doi:10.1145/62546.62593.
Y. Hirai (2010):
An Intuitionistic Epistemic Logic for Sequential Consistency on Shared Memory.
In: LPAR.
Springer Berlin Heidelberg,
pp. 272–289.
S. Knight, B. Maubert & F. Schwarzentruber (2017):
Reasoning about knowledge and messages in asynchronous multi-agent systems.
Mathematical Structures in Computer Science,
pp. 1–42,
doi:10.1017/S0960129517000214.
D. N. Kozlov (2012):
Chromatic subdivision of a simplicial complex.
Homology Homotopy Appl. 14(2),
pp. 197–209,
doi:10.4310/HHA.2012.v14.n2.a12.
Yoram Moses (2015):
Relating Knowledge and Coordinated Action: The Knowledge of Preconditions Principle.
In: TARK.
EPTCS,
pp. 231–245,
doi:10.4204/EPTCS.215.17.
T. Porter (2004):
Interpreted systems and Kripke models for multiagent systems from a categorical perspective.
Theoretical Computer Science 323(1),
pp. 235 – 266,
doi:10.1016/j.tcs.2004.04.005.
Y. Moses R. Fagin, J. Halpern & M. Vardi (1995):
Reasoning About Knowledge.
MIT Press.
S. Rajsbaum (2010):
Iterated Shared Memory Models.
In: LATIN,
LNCS 6034.
Springer,
pp. 407–416,
doi:10.1007/978-3-642-12200-2_36.
eptcs@eptcs.org