Michael Hersche, Mustafa Zeqiri, et al.
NeSy 2023
We consider a problem of decentralized exploration of a faulty network by several simple, memoryless agents. The model we adopt for a network is a directed graph. We design an asynchronous algorithm that can cope with failures of network edges and nodes. The algorithm is self-stabilizing in the sense that it can be started with arbitrary initializations and scalable -new agents can be added while other agents are already running.
Michael Hersche, Mustafa Zeqiri, et al.
NeSy 2023
Imran Nasim, Melanie Weber
SCML 2024
Michael Moreinis, Arkadiy Morgenshtein, et al.
ICECS 2004
Ran Iwamoto, Kyoko Ohara
ICLC 2023