DataCite
metadata only
Model Checking of Distributed Algorithm Implementations
It is notoriously difficult to develop reliable, high-performance distributed systems that run over asynchronous networks. Even if a distributed system is based on a well-understood distributed algorithm, its implementation can contain errors arising from complexities of realistic distributed enviro
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Unreliable failure detectors for reliable distributed systems#6688
- SafePar: Monitoring Asynchrony in Microservices#1117793
- SafePar: Monitoring Asynchrony in Microservices#1108661
- On the Decidability of Distributed Tasks with Output Sets under Asynchrony and Any Number of Crashes#2552
- Byzantine-Tolerant Causal Unicast with Constant Message Space Overhead#1216743
Record · ID 1361784
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive