SELF-STABILIZING DEPTH-FIRST MULTI-TOKEN CIRCULATION IN TREE NETWORKS

DOI10.1080/01495730108935264zbMath0977.68005OpenAlexW2052232421MaRDI QIDQ2735232

Pradip K. Srimani, Gheorghe Antonoiu

Publication date: 17 January 2002

Published in: Parallel Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01495730108935264

zbMATH Keywords

self stabilization

Mathematics Subject Classification ID

Distributed systems (68M14)

Cites Work

• Stabilizing unison
• A belated proof of self-stabilization
• Self-stabilization (in spite of distributed control) in tree-structured systems
• Self-stabilization of dynamic systems assuming only read/write atomicity
• Self-stabilizing extensions for message-passing systems
• Self-stabilizing depth-first search
• Self-stabilizing systems in spite of distributed control
• Resource Bounds for Self-Stabilizing Message-Driven Protocols
• A SELF-STABILIZING DISTRIBUTED ALGORITHM FOR ALL-PAIRS SHORTEST PATH PROBLEM

This page was built for publication: SELF-STABILIZING DEPTH-FIRST MULTI-TOKEN CIRCULATION IN TREE NETWORKS