An automata-theoretic approach to the verification of distributed algorithms.
C. AiswaryaBenedikt BolligPaul GastinPublished in: Inf. Comput. (2018)
Keyphrases
- distributed environment
- computational cost
- learning algorithm
- times faster
- significant improvement
- computational efficiency
- lightweight
- computationally efficient
- theoretical analysis
- graph theory
- orders of magnitude
- benchmark datasets
- data structure
- model checking
- distributed systems
- computational complexity
- combinatorial optimization
- multi agent