Complexity of Verification and Synthesis of Threshold Automata
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2020
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915644161654784 |
|---|---|
| author | Balasubramanian, A. R. Esparza, Javier Lazic, Marijana |
| author_facet | Balasubramanian, A. R. Esparza, Javier Lazic, Marijana |
| contents | Threshold automata are a formalism for modeling and analyzing fault-tolerant distributed algorithms, recently introduced by Konnov, Veith, and Widder, describing protocols executed by a fixed but arbitrary number of processes. We conduct the first systematic study of the complexity of verification and synthesis problems for threshold automata. We prove that the coverability, reachability, safety, and liveness problems are NP-complete, and that the bounded synthesis problem is $Σ_p^2$ complete. A key to our results is a novel characterization of the reachability relation of a threshold automaton as an existential Presburger formula. The characterization also leads to novel verification and synthesis algorithms. We report on an implementation, and provide experimental results. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2007_06248 |
| institution | arXiv |
| publishDate | 2020 |
| record_format | arxiv |
| spellingShingle | Complexity of Verification and Synthesis of Threshold Automata Balasubramanian, A. R. Esparza, Javier Lazic, Marijana Logic in Computer Science Distributed, Parallel, and Cluster Computing Threshold automata are a formalism for modeling and analyzing fault-tolerant distributed algorithms, recently introduced by Konnov, Veith, and Widder, describing protocols executed by a fixed but arbitrary number of processes. We conduct the first systematic study of the complexity of verification and synthesis problems for threshold automata. We prove that the coverability, reachability, safety, and liveness problems are NP-complete, and that the bounded synthesis problem is $Σ_p^2$ complete. A key to our results is a novel characterization of the reachability relation of a threshold automaton as an existential Presburger formula. The characterization also leads to novel verification and synthesis algorithms. We report on an implementation, and provide experimental results. |
| title | Complexity of Verification and Synthesis of Threshold Automata |
| topic | Logic in Computer Science Distributed, Parallel, and Cluster Computing |
| url | https://arxiv.org/abs/2007.06248 |