Emptiness Problems for Distributed Automata
We investigate the decidability of the emptiness problem for three classes of distributed automata.These devices operate on finite directed graphs, acting as networks of identical finite-state machines that communicate in an infinite sequence of synchronous rounds.The problem is shown to be decidable in LogSpace kicker pro comp 10 for a class of fo