Predecessor existence problems for finite discrete dynamical systems

We study the predecessor existence problem for finite discrete dynamical systems. Given a finite discrete dynamical system S and a configuration C, the Predecessor existence (or Pre) problem is to determine whether there is a configuration C^' such that S has a transition from C^' to C. In addition to the decision version, we also study the following variants: the #-Predecessor existence (or #Pre) problem-counting the number of predecessors, the Unique-Predecessor existence (or UPre) problem-deciding whether there is a unique predecessor and the Ambiguous-Predecessor existence (or APre) problem-given a configuration C and a predecessor C^' of C, deciding whether there is a different predecessor C^'' of C. General techniques are presented for simultaneously characterizing the computational complexity of the Pre problem and its three variants. Our hardness results are based on the concept of simultaneous reductions: single transformations that can be used to simultaneously prove the hardness of the different variants of the Pre problem for their respective complexity classes. Our easiness results are based on dynamic programming and they extend the previous results on Pre problem for one-dimensional cellular automata. The hardness results together with the easiness results provide a tight separation between easy and hard instances. Further, the results imply similar bounds for other classes of finite discrete dynamical systems including discrete Hopfield and recurrent neural networks, concurrent state machines, systolic networks and one- and two-dimensional cellular automata. Our results extend the earlier results of Green, Sutner and Orponen on the complexity of the predecessor existence problem and its variants.

[1]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[2]  Reinhard Laubenbacher,et al.  Equivalence Relations on Finite Dynamical Systems , 2001, Adv. Appl. Math..

[3]  Harry B. Hunt,et al.  Power indices and easier hard problems , 2005, Mathematical systems theory.

[4]  Klaus Sutner,et al.  On the Computational Complexity of Finite Cellular Automata , 1995, J. Comput. Syst. Sci..

[5]  Max H. Garzon,et al.  Models of Massive Parallelism , 1995, Texts in Theoretical Computer Science. An EATCS Series.

[6]  Karel Culik,et al.  A Simple Universal Cellular Automaton and its One-Way and Totalistic Version , 1987, Complex Syst..

[7]  Hans L. Bodlaender,et al.  Treewidth: Algorithmic Techniques and Results , 1997, MFCS.

[8]  Thomas Lengauer,et al.  Processing of Hierarchically Defined Graphs and Graph Families , 1992, Data Structures and Efficient Algorithms.

[9]  H. Gutowitz.  Cellular automata: theory and experiment : proceedings of a workshop , 1991 .

[10]  Alexander Moshe Rabinovich,et al.  Complexity of Equivalence Problems for Concurrent Systems of Finite Agents , 1997, Inf. Comput..

[11]  Cristopher Moore,et al.  Computational Complexity and Statistical Physics , 2006, Santa Fe Institute Studies in the Sciences of Complexity.

[12]  Harry B. Hunt,et al.  Reachability problems for sequential dynamical systems with threshold functions , 2003, Theor. Comput. Sci..

[13]  Sanjeev Khanna,et al.  Complexity classifications of Boolean constraint satisfaction problems , 2001, SIAM monographs on discrete mathematics and applications.

[14]  M. Macy,et al.  FROM FACTORS TO ACTORS: Computational Sociology and Agent-Based Modeling , 2002 .

[15]  M H Freedman,et al.  Limit, logic, and computation , 1998, Proc. Natl. Acad. Sci. USA.

[16]  Giorgio Delzanno,et al.  SAT-Based Analysis of Cellular Automata , 2004, ACRI.

[17]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[18]  Predrag T. Tosic.  Counting Fixed Points and Gardens of Eden of Sequential Dynamical Systems on Planar Bipartite Graphs , 2005, Electron. Colloquium Comput. Complex..

[19]  Norman Margolus,et al.  An FPGA architecture for DRAM-based systolic computations , 1997, Proceedings. The 5th Annual IEEE Symposium on Field-Programmable Custom Computing Machines Cat. No.97TB100186).

[20]  Pekka Orponen.  An Overview Of The Computational Power Of Recurrent Neural Networks , 2000 .

[21]  H. L. Bodlaender,et al.  Treewidth: Algorithmic results and techniques , 1997 .

[22]  Nadia Creignou,et al.  Complexity of Generalized Satisfiability Counting Problems , 1996, Inf. Comput..

[23]  Robert L. Axtell,et al.  WHY AGENTS? ON THE VARIED MOTIVATIONS FOR AGENT COMPUTING IN THE SOCIAL SCIENCES , 2000 .

[24]  Russell Impagliazzo,et al.  Which Problems Have Strongly Exponential Complexity? , 2001, J. Comput. Syst. Sci..

[25]  Madhav V. Marathe,et al.  Towards a Predictive Computational Complexity Theory , 2000, ICALP.

[26]  Christian M. Reidys,et al.  Elements of a theory of simulation III: equivalence of SDS , 2001, Appl. Math. Comput..

[27]  Stephen Wolfram,et al.  Theory and Applications of Cellular Automata , 1986 .

[28]  Joshua M. Epstein,et al.  Generative Social Science: Studies in Agent-Based Computational Modeling (Princeton Studies in Complexity) , 2007 .

[29]  Leslie G. Valiant,et al.  The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..

[30]  Christian M. Reidys,et al.  On Acyclic Orientations and Sequential Dynamical Systems , 2001, Adv. Appl. Math..

[31]  Patrick Brézillon,et al.  Lecture Notes in Artificial Intelligence , 1999 .

[32]  Pekka Orponen,et al.  General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results , 2003, Neural Computation.

[33]  Karel Culik,et al.  On the Limit Sets of Cellular Automata , 1989, SIAM J. Comput..

[34]  Predrag T. Tosic.  On the Complexity of Counting Fixed Points and Gardens of Eden in Sequential Dynamical Systems on Planar Bipartite Graphs , 2006, Int. J. Found. Comput. Sci..

[35]  M. Batty.  Generative social science: Studies in agent-based computational modeling , 2008 .

[36]  Wuxu Peng,et al.  Deadlock detection in communicating finite state machines by even reachability analysis , 1995, Proceedings of Fourth International Conference on Computer Communications and Networks - IC3N'95.

[37]  Leslie G. Valiant,et al.  NP is as easy as detecting unique solutions , 1985, STOC '85.

[38]  Éva Tardos,et al.  Influential Nodes in a Diffusion Model for Social Networks , 2005, ICALP.

[39]  Luca Trevisan,et al.  Constraint satisfaction: the approximability of minimization problems , 1997, Proceedings of Computational Complexity. Twelfth Annual IEEE Conference.

[40]  Harry B. Hunt,et al.  The Complexity of Planar Counting Problems , 1998, SIAM J. Comput..

[41]  Sandeep K. Shukla,et al.  On the Complexity of Relational Problems for Finite State Processes (Extended Abstract) , 1996, ICALP.

[42]  Reinhard Laubenbacher,et al.  Decomposition and simulation of sequential dynamical systems , 2003, Adv. Appl. Math..

[43]  Palash Sarkar,et al.  A brief history of cellular automata , 2000, CSUR.

[44]  Thomas J. Schaefer,et al.  The complexity of satisfiability problems , 1978, STOC.

[45]  Pekka Orponen,et al.  Computational complexity of neural networks: a survey , 1994 .

[46]  X. Jin.  Factor graphs and the Sum-Product Algorithm , 2002 .

[47]  Bruno Durand.  Inversion of 2D Cellular Automata: Some Complexity Results , 1994, Theor. Comput. Sci..

[48]  David Harel,et al.  On the Complexity of Verifying Concurrent Transition Systems , 1997, Inf. Comput..

[49]  H. T. Kung.  Why systolic architectures? , 1982, Computer.

[50]  Edward A. Feigenbaum,et al.  Switching and Finite Automata Theory: Computer Science Series , 1990 .

[51]  Karel Culik,et al.  On Totalistic Systolic Networks , 1988, Inf. Process. Lett..

[52]  Gul A. Agha,et al.  On Computational Complexity of Counting Fixed Points in Symmetric Boolean Graph Automata , 2005, UC.

[53]  Klaus Sutner,et al.  Additive Automata On Graphs , 1988, Complex Syst..

[54]  Norman Margolus,et al.  An embedded DRAM architecture for large-scale spatial-lattice computations , 2000, Proceedings of 27th International Symposium on Computer Architecture (IEEE Cat. No.RS00201).

[55]  Aravind Srinivasan,et al.  Modelling disease outbreaks in realistic urban social networks , 2004, Nature.

[56]  Glynn Winskel,et al.  Bisimulation from Open Maps , 1994, Inf. Comput..

[57]  Frederic Green,et al.  NP-Complete Problems in Cellular Automata , 1987, Complex Syst..

[58]  André DeHon,et al.  Very Large Scale Spatial Computing , 2002, UMC.

[59]  Pekka Orponen,et al.  Attraction Radii in Binary Hopfield Nets are Hard to Compute , 1993, Neural Computation.

[60]  Harry B. Hunt,et al.  Predecessor and Permutation Existence Problems for Sequential Dynamical Systems , 2003, DMCS.

[61]  John H. Reif,et al.  Synthesis of Parallel Algorithms , 1993 .

[62]  Shing-Chi Cheung,et al.  Tractable Dataflow Analysis for Distributed Systems , 1994, IEEE Trans. Software Eng..

[63]  Harry B. Hunt,et al.  Gardens of Eden and Fixed Points in Sequential Dynamical Systems , 2001, DM-CCG.

[64]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[65]  Harry B. Hunt,et al.  Strongly-local reductions and the complexity/efficient approximability of algebra and optimization on abstract algebraic structures , 2001, ISSAC '01.

[66]  Ioannis G. Tollis,et al.  Planar grid embedding in linear time , 1989 .

[67]  Zsuzsanna Róka.  One-way Cellular Automata on Cayley Graphs , 1993, FCT.

[68]  Mohamed G. Gouda,et al.  Proving liveness for networks of communicating finite state machines , 1986, TOPL.

[69]  Euel Elliott,et al.  Adaptive agents, intelligence, and emergent human organization: Capturing complexity through agent-based modeling , 2002, Proceedings of the National Academy of Sciences of the United States of America.

[70]  Pekka Orponen,et al.  Complexity Issues in Discrete Hopfield Networks , 1994 .

[71]  Max H. Garzon,et al.  Models of massive parallelism: analysis of cellular automata and neural networks , 1995 .

[72]  Salil P. Vadhan,et al.  The Complexity of Counting in Sparse, Regular, and Planar Graphs , 2002, SIAM J. Comput..

[73]  Robert L. Axtell,et al.  Effects of Interaction Topology and Activation Regime in Several Multi-Agent Systems , 2000, MABS.

[74]  Christian M. Reidys,et al.  Discrete, sequential dynamical systems , 2001, Discret. Math..

[75]  J. Taylor,et al.  Switching and finite automata theory, 2nd ed. , 1980, Proceedings of the IEEE.

[76]  R. Laubenbacher,et al.  A computational algebra approach to the reverse engineering of gene regulatory networks. , 2003, Journal of theoretical biology.