Verifying livelock freedom on parameterized rings and chains
Document Type
Conference Proceeding
Publication Date
2013
Department
Department of Computer Science
Abstract
This paper investigates the complexity of verifying livelock freedom, self-stabilization, and weak stabilization in parameterized unidirectional ring and bidirectional chain topologies. Specifically, we illustrate that verifying livelock freedom of parameterized rings consisting of self-disabling and deterministic processes is undecidable (specifically, Π10-complete). This result implies that verifying self-stabilization and weak stabilization for parameterized rings of self-disabling processes is also undecidable. The results of this paper strengthen previous work on the undecidability of verifying temporal logic properties in symmetric ring protocols. The proof of undecidability is based on a reduction from the periodic domino problem.
Publication Title
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISBN
978-3-319-03089-0
Recommended Citation
Klinkhamer, A.,
&
Ebnenasir, A.
(2013).
Verifying livelock freedom on parameterized rings and chains.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),
8255 LNCS, 163-177.
http://doi.org/10.1007/978-3-319-03089-0_12
Retrieved from: https://digitalcommons.mtu.edu/michigantech-p/4064