We describe ongoing work that models conflict-free replicated data types (CRDTs) from a coalgebraic point of view. CRDTs are data structures designed for replication across multiple physical locations in a distributed system. We show how to model a CRDT at the local replica level using a novel coalgebraic semantics for CRDTs. We believe this is the first step towards presenting a unified theory for specifying and verifying CRDTs and replicated state machines. As a case study, we consider emulation of CRDTs in terms of coalgebra.
@InProceedings{liittschwager_et_al:LIPIcs.CALCO.2023.22, author = {Liittschwager, Nathan and Tsampas, Stelios and Castello, Jonathan and Kuper, Lindsey}, title = {{CRDTs, Coalgebraically}}, booktitle = {10th Conference on Algebra and Coalgebra in Computer Science (CALCO 2023)}, pages = {22:1--22:5}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-287-7}, ISSN = {1868-8969}, year = {2023}, volume = {270}, editor = {Baldan, Paolo and de Paiva, Valeria}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CALCO.2023.22}, URN = {urn:nbn:de:0030-drops-188198}, doi = {10.4230/LIPIcs.CALCO.2023.22}, annote = {Keywords: Coalgebra, Distributed Systems, Concurrency, Bisimulation} }
Feedback for Dagstuhl Publishing