Weak models of distributed computing, with connections to modal logic

DOI10.1145/2332432.2332466zbMath1301.68120DBLPconf/podc/HellaJKLLLSV12arXiv1205.2051OpenAlexW2148219974WikidataQ58179405 ScholiaQ58179405MaRDI QIDQ5891978

Matti Järvisalo, Antti Kuusisto, Jukka Suomela, Kerkko Luosto, Jonni Virtema, Lauri Hella, Tuomo Lempiäinen, Juhana Laurinharju

Publication date: 5 December 2014

Published in: Proceedings of the 2012 ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1205.2051

zbMATH Keywords

modal logicanonymous networksgraph problemsdeterministic distributed algorithmsport-numbering model

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Logic in computer science (03B70) Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (6)

Emptiness problems for distributed automata ⋮ Theory of graph neural networks: representation and learning ⋮ Unnamed Item ⋮ Distributed Graph Algorithms and their Complexity: An Introduction ⋮ Weak models of distributed computing, with connections to modal logic ⋮ Broadcasting Automata and Patterns on ℤ2

This page was built for publication: Weak models of distributed computing, with connections to modal logic