PSPACE-completeness of majority automata networks

Eric Goles Chacc (1) , Pedro Montealegre (2) , Ville Salo (3) , Ilkka Törmä (4)

1 Facultad de Ingeniería y Ciencias [Santiago]
2 LIFO - Laboratoire d'Informatique Fondamentale d'Orléans
3 CMM - Centre de modélisation mathématique / Centro de Modelamiento Matemático [Santiago]
4 Turku Centre for Computer Science

We study the dynamics of majority automata networks when the vertices are updated according to a block sequential updating scheme. In particular, we show that the complexity of the problem of predicting an eventual state change in some vertex, given an initial configuration, is PSPACE-complete.

Domaines: Informatique [cs]

Eric Goles Chacc, Pedro Montealegre, Ville Salo, Ilkka Törmä. PSPACE-completeness of majority automata networks. Theoretical Computer Science, 2016, 609, pp.118-128. ⟨10.1016/j.tcs.2015.09.014⟩. ⟨hal-01315324⟩