Complexity of Coverability in Bounded Path Broadcast Networks
Gespeichert in:
| Titel: | Complexity of Coverability in Bounded Path Broadcast Networks |
|---|---|
| Autoren: | Balasubramanian, A. R. |
| Weitere Verfasser: | A. R. Balasubramanian, Bojańczyk, Mikołaj, Chekuri, Chandra |
| Quelle: | 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2021 |
| Verlagsinformationen: | Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2021. |
| Publikationsjahr: | 2021 |
| Schlagwörter: | Bounded path networks, Theory of computation → Distributed computing models, Parameterized verification, Theory of computation → Problems, reductions and completeness, ddc:004, Fast-growing complexity classes |
| Beschreibung: | Broadcast networks are a formalism of distributed computation that allow one to model networks of identical nodes communicating through message broadcasts over a communication topology that does not change over the course of executions. The parameterized verification problem for these networks amounts to proving correctness of a property for any number of nodes, and on all executions. Dually speaking, this problem asks for the existence of an execution of the broadcast network that violates a given property. One specific instance of parameterized verification is the coverability problem which asks whether there is an execution of the network in which some node reaches a given state of the broadcast protocol. This problem was proven to be undecidable by Delzanno, Sangnier and Zavattaro (CONCUR 2010). In the same paper, the authors also prove that, if we additionally assume that the underlying communication topology has a bound on the longest path, then the coverability problem becomes decidable. In this paper, we provide complexity results for the above problem and prove that the coverability problem for bounded-path topologies is 𝐅_ε₀-complete, where 𝐅_ε₀ is a class in the fast-growing hierarchy of complexity classes. This solves an open problem of Hasse, Schmitz and Schnoebelen (LMCS, Vol 10, Issue 4). |
| Publikationsart: | Conference object Article |
| Dateibeschreibung: | application/pdf |
| Sprache: | English |
| DOI: | 10.4230/lipics.fsttcs.2021.35 |
| Zugangs-URL: | https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2021.35 |
| Rights: | CC BY |
| Dokumentencode: | edsair.dedup.wf.002..53492e3560e737aebe97b67ea2c6daec |
| Datenbank: | OpenAIRE |
Nájsť tento článok vo Web of Science | Abstract: | Broadcast networks are a formalism of distributed computation that allow one to model networks of identical nodes communicating through message broadcasts over a communication topology that does not change over the course of executions. The parameterized verification problem for these networks amounts to proving correctness of a property for any number of nodes, and on all executions. Dually speaking, this problem asks for the existence of an execution of the broadcast network that violates a given property. One specific instance of parameterized verification is the coverability problem which asks whether there is an execution of the network in which some node reaches a given state of the broadcast protocol. This problem was proven to be undecidable by Delzanno, Sangnier and Zavattaro (CONCUR 2010). In the same paper, the authors also prove that, if we additionally assume that the underlying communication topology has a bound on the longest path, then the coverability problem becomes decidable. In this paper, we provide complexity results for the above problem and prove that the coverability problem for bounded-path topologies is 𝐅_ε₀-complete, where 𝐅_ε₀ is a class in the fast-growing hierarchy of complexity classes. This solves an open problem of Hasse, Schmitz and Schnoebelen (LMCS, Vol 10, Issue 4). |
|---|---|
| DOI: | 10.4230/lipics.fsttcs.2021.35 |