License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSTTCS.2020.37
URN: urn:nbn:de:0030-drops-132787
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2020/13278/
Balasubramanian, A. R.
Parameterized Complexity of Safety of Threshold Automata
Abstract
Threshold automata are a formalism for modeling fault-tolerant distributed algorithms. In this paper, we study the parameterized complexity of reachability of threshold automata. As a first result, we show that the problem becomes W[1]-hard even when parameterized by parameters which are quite small in practice. We then consider two restricted cases which arise in practice and provide fixed-parameter tractable algorithms for both these cases. Finally, we report on experimental results conducted on some protocols taken from the literature.
BibTeX - Entry
@InProceedings{balasubramanian:LIPIcs:2020:13278,
author = {A. R. Balasubramanian},
title = {{Parameterized Complexity of Safety of Threshold Automata}},
booktitle = {40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020)},
pages = {37:1--37:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-174-0},
ISSN = {1868-8969},
year = {2020},
volume = {182},
editor = {Nitin Saxena and Sunil Simon},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2020/13278},
URN = {urn:nbn:de:0030-drops-132787},
doi = {10.4230/LIPIcs.FSTTCS.2020.37},
annote = {Keywords: Threshold automata, distributed algorithms, parameterized complexity}
}
|
Keywords: |
|
Threshold automata, distributed algorithms, parameterized complexity |
|
Collection: |
|
40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020) |
|
Issue Date: |
|
2020 |
|
Date of publication: |
|
04.12.2020 |
