On the completeness of bounded model checking for threshold-based distributed algorithms: reachability (Q729813)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the completeness of bounded model checking for threshold-based distributed algorithms: reachability |
scientific article; zbMATH DE number 6668158
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the completeness of bounded model checking for threshold-based distributed algorithms: reachability |
scientific article; zbMATH DE number 6668158 |
Statements
On the completeness of bounded model checking for threshold-based distributed algorithms: reachability (English)
0 references
22 December 2016
0 references
model checking
0 references
fault-tolerant distributed algorithms
0 references
Byzantine faults
0 references
computational models
0 references
0 references
0 references
