Reachability problems for sequential dynamical systems with threshold functions

  • Authors:

  • Chris Barrett;Harry B. Hunt, III;Madhav V. Marathe;S. S. Ravi;Daniel J. Rosenkrantz;Richard E. Stearns

  • Affiliations:

  • Los Alamos National Laboratory, MS M997, P.O. Box 1663, Los Alamos, NM;Department of Computer Science, University at Albany--SUNY, 1400 Washington Ave., Albany, NY;Los Alamos National Laboratory, MS M997, P.O. Box 1663, Los Alamos, NM;Department of Computer Science, University at Albany--SUNY, 1400 Washington Ave., Albany, NY;Department of Computer Science, University at Albany--SUNY, 1400 Washington Ave., Albany, NY;Department of Computer Science, University at Albany--SUNY, 1400 Washington Ave., Albany, NY

  • Venue:
  • Theoretical Computer Science - Mathematical foundations of computer science
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

A sequential dynamical system (SDS) over a domain D is a triple (G, F, π), where (i) G(V,E) is an undirected graph with n nodes with each node having a state value from D, (ii) F = {f1, f2,..., fn} is a set of local transition functions with fi denoting the local transition function associated with node vi and (iii) π is a permutation of (i.e., a total order on) the nodes in V. A single SDS transition is obtained by updating the states of the nodes in V by evaluating the function associated with each of them in the order given by π.We consider reachability problems for SDSs with restricted local transition functions. Our main intractability results show that the reachability problems for SDSs are PSPACE-complete when either of the following restrictions hold: (i) F consists of both simple-threshold-functions and simple-inverted-threshold functions, or (ii) F consists only of threshold-functions that use weights in an asymmetric manner. Moreover, the results hold even for SDSs whose underlying graphs have bounded node degree and bounded pathwidth. Our lower bound results also extend to reachability problems for Hopfield networks and communicating finite state machines.On the positive side, we show that when F consists only of threshold functions that use weights in a symmetric manner, reachability problems can be solved efficiently provided all the weights are strictly positive and the ratio of the largest to the smallest weight is bounded by a polynomial function of the number of nodes.