Automated Verification of a Randomized Distributed Consensus Protocol Using Cadence SMV and PRISM?
- 4 July 2001
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 194-206
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case studyDistributed Computing, 2000
- A Markov Chain Model Checker2000
- Induction in Compositional Model CheckingLecture Notes in Computer Science, 2000
- Verification of Infinite State Systems by Compositional Model Checking1999
- On the Semantic Foundations of Probabilistic Synchronous Reactive ProgramsElectronic Notes in Theoretical Computer Science, 1999
- Model checking for a probabilistic branching time logic with fairnessDistributed Computing, 1998
- Verification of an implementation of Tomasulo's algorithm by compositional model checking1998
- A logic for reasoning about time and reliabilityFormal Aspects of Computing, 1994
- Fast randomized consensus using shared memoryJournal of Algorithms, 1990
- Impossibility of distributed consensus with one faulty processJournal of the ACM, 1985