Conference paper
Program equivalence and context-free grammars
Barry K. Rosen
SWAT 1972
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.
Barry K. Rosen
SWAT 1972
Ryan Johnson, Ippokratis Pandis
CIDR 2013
Albert Atserias, Anuj Dawar, et al.
Journal of the ACM
Robert Farrell, Rajarshi Das, et al.
AAAI-SS 2010