Eliminating Message Counters in Synchronous Threshold Automata
- 12 January 2021
- book chapter
- Published by Springer Nature
- p. 196-218
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Complexity of Verification and Synthesis of Threshold Automata2020
- Communication-Closed Asynchronous Protocols2019
- On the Completeness of Verifying Message Passing Programs Under Bounded Asynchrony2018
- Parameterized Model Checking of Synchronous Distributed Algorithms by Abstraction2017
- Verifying distributed programs via canonical sequentializationProceedings of the ACM on Programming Languages, 2017
- Synchronous consensus under hybrid process and link failuresTheoretical Computer Science, 2011
- Linear Quantifier Elimination as an Abstract Decision Procedure2010
- A Reduction Theorem for the Verification of Round-Based Distributed AlgorithmsLecture Notes in Computer Science, 2009
- Distributed Computing2004
- Towards optimal distributed consensus1989