Computing anonymously with arbitrary knowledge

Abstract

The relations that can be computed with arbitrary knowledge on networks where all processors use the same algorithm and start from the same state are investigated. Three known activation models are considered, namely, asynchronous, synchronous, and interleaved. The networks are directed graphs colored on their arcs, and each processor changes its state depending on its previous state and on the state of its in-neighbors.