Computing the Fault-Containment Time of Self-Stabilizing Algorithms Using Markov Chains and Lumping

DOI10.1007/978-3-319-69084-1_5zbMath1498.68373OpenAlexW2764106705MaRDI QIDQ5045434

Volker Turau

Publication date: 4 November 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-69084-1_5

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Distributed algorithms (68W15)

This page was built for publication: Computing the Fault-Containment Time of Self-Stabilizing Algorithms Using Markov Chains and Lumping