Rice-Like Theorems for Automata Networks - Archive ouverte HAL Accéder directement au contenu
Chapitre D'ouvrage Année : 2021

Rice-Like Theorems for Automata Networks

Résumé

We prove general complexity lower bounds on automata networks, in the style of Rice's theorem, but in the computable world. Our main result is that testing any fixed first-order property on the dynamics of an automata network is either trivial, or NP-hard, or coNP-hard. Moreover, there exist such properties that are arbitrarily high in the polynomial-time hierarchy. We also prove that testing a first-order property given as input on an automata network (also part of the input) is PSPACE-hard. Besides, we show that, under a natural effectiveness condition, any nontrivial property of the limit set of a nondeterministic network is PSPACE-hard. We also show that it is PSPACE-hard to separate deterministic networks with a very high and a very low number of limit configurations; however, the problem of deciding whether the number of limit configurations is maximal up to a polynomial quantity belongs to the polynomial-time hierarchy.
Fichier principal
Vignette du fichier
LIPIcs-STACS-2021-32.pdf (736.34 Ko) Télécharger le fichier
Origine : Publication financée par une institution

Dates et versions

hal-03430841 , version 1 (16-11-2021)

Identifiants

Citer

Guilhem Gamard, Pierre Guillon, Kevin Perrot, Guillaume Theyssier. Rice-Like Theorems for Automata Networks. 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021), 2021, ⟨10.4230/LIPIcs.STACS.2021.32⟩. ⟨hal-03430841⟩
52 Consultations
51 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More