Eliminating Message Counters in Threshold Automata
Authors:
- 12 October 2020
- book chapter
- Published by Springer Nature
- p. 196-212
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- ByMC: Byzantine Model Checker2018
- On the completeness of bounded model checking for threshold-based distributed algorithms: ReachabilityInformation and Computation, 2017
- A short counterexample property for safety and liveness verification of fault-tolerant distributed algorithms2017
- Parameterized model checking of fault-tolerant distributed algorithms by abstraction2013
- Linear Quantifier Elimination as an Abstract Decision Procedure2010
- Z3: An Efficient SMT Solver2008
- Unreliable failure detectors for reliable distributed systemsJournal of the ACM, 1996
- A practical algorithm for exact array dependence analysisCommunications of the ACM, 1992
- Asynchronous consensus and broadcast protocolsJournal of the ACM, 1985
- Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols1983