Computational complexity of threshold automata networks under different updating schemes

Eric Goles Chacc (1) , Pedro Montealegre (2)

1 Facultad de Ingeniería y Ciencias [Santiago]
2 LIFO - Laboratoire d'Informatique Fondamentale d'Orléans

Given a threshold automata network, as well as an updating scheme over its vertices, we study the computational complexity associated with the prediction of the future state of a vertex. More precisely, we analyze two classes of local functions: the majority and the AND–OR rule (vertices take the And or the Or logic functions over the state of its neighborhoods). Depending on the updating scheme, we determine the complexity class (NC, P, NP, PSPACE) where the prediction problem belongs.

Mots clés: NC; Updating scheme; P-completeness; Automata networks; Threshold functions; Computational complexity; NP-Hard

Domaines: Informatique [cs]

Eric Goles Chacc, Pedro Montealegre. Computational complexity of threshold automata networks under different updating schemes. Theoretical Computer Science, 2014, 559, pp.3-19. ⟨10.1016/j.tcs.2014.09.010⟩. ⟨hal-01315323⟩