A Reduction Theorem for the Verification of Round-Based Distributed Algorithms

DOI10.1007/978-3-642-04420-5_10zbMath1260.68450OpenAlexW1858035675MaRDI QIDQ3646255

Stephan Merz, Mouna Chaouch-Saad, Bernadette Charron-Bost

Publication date: 19 November 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-04420-5_10

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Specification and verification (program logics, model checking, etc.) (68Q60) Distributed algorithms (68W15)

Related Items (13)

Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker ⋮ The Heard-Of model: computing in distributed systems with benign faults ⋮ Guessing the Buffer Bound for k-Synchronizability ⋮ Unnamed Item ⋮ On the \(k\)-synchronizability of systems ⋮ An automata-theoretic approach to the verification of distributed algorithms ⋮ Verification of consensus algorithms using satisfiability solving ⋮ Structural transformations for data-enriched real-time systems ⋮ Eliminating message counters in synchronous threshold automata ⋮ A reduction theorem for randomized distributed algorithms under weak adversaries ⋮ Unnamed Item ⋮ Characterizing Consensus in the Heard-Of Model ⋮ Guessing the buffer bound for k-synchronizability

Uses Software

• TLC

Cites Work

• Unnamed Item
• Unnamed Item
• Stutter-invariant temporal properties are expressible without the next-time operator
• Decomposition of distributed programs into communication-closed layers
• Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem
• The Heard-Of model: computing in distributed systems with benign faults
• Using Bounded Model Checking to Verify Consensus Algorithms
• Time, clocks, and the ordering of events in a distributed system

This page was built for publication: A Reduction Theorem for the Verification of Round-Based Distributed Algorithms