On the impact of treewidth in the computational complexity of freezing dynamics

by   Eric Goles, et al.

An automata network is a network of entities, each holding a state from a finite set and evolving according to a local update rule which depends only on its neighbors in the network's graph. It is freezing if there is an order on states such that the state evolution of any node is non-decreasing in any orbit. They are commonly used to model epidemic propagation, diffusion phenomena like bootstrap percolation or cristal growth. In this paper we establish how treewidth and maximum degree of the underlying graph are key parameters which influence the overall computational complexity of finite freezing automata networks. First, we define a general model checking formalism that captures many classical decision problems: prediction, nilpotency, predecessor, asynchronous reachability. Then, on one hand, we present an efficient parallel algorithm that solves the general model checking problem in NC for any graph with bounded degree and bounded treewidth. On the other hand, we show that these problems are hard in their respective classes when restricted to families of graph with polynomially growing treewidth. For prediction, predecessor and asynchronous reachability, we establish the hardness result with a fixed set-defiend update rule that is universally hard on any input graph of such families.


page 1

page 2

page 3

page 4


Intrinsic Simulations and Universality in Automata Networks

An automata network (AN) is a finite graph where each node holds a state...

Defensive Alliances in Graphs of Bounded Treewidth

A set S of vertices of a graph is a defensive alliance if, for each elem...

Computational Complexity of Hedonic Games on Sparse Graphs

The additively separable hedonic game (ASHG) is a model of coalition for...

Backwards Reachability for Probabilistic Timed Automata: A Replication Report

Backwards reachability is an efficient zone-based approach for model che...

Reachability in High Treewidth Graphs

Reachability is the problem of deciding whether there is a path from one...

On Symmetry versus Asynchronism: at the Edge of Universality in Automata Networks

An automata network (AN) is a finite graph where each node holds a state...

Courcelle's Theorem Made Dynamic

Dynamic complexity is concerned with updating the output of a problem wh...

Please sign up or login with your details

Forgot password? Click here to reset