Proving liveness for networks of communicating finite state machines
ACM Transactions on Programming Languages and Systems (TOPLAS) - The MIT Press scientific computation series
NP is as easy as detecting unique solutions
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
On totalistic systolic networks
Information Processing Letters
Complex Systems
On the limit sets of cellular automata
SIAM Journal on Computing
Cellular automata: theory and experiment
Cellular automata: theory and experiment
One-way cellular automata on Cayley graphs
Theoretical Computer Science
Inversion of 2D cellular automata: some complexity results
Theoretical Computer Science
On the computational complexity of finite cellular automata
Journal of Computer and System Sciences
Models of massive parallelism: analysis of cellular automata and neural networks
Models of massive parallelism: analysis of cellular automata and neural networks
Complexity of generalized satisfiability counting problems
Information and Computation
Deadlock detection in communicating finite state machines by even reachability analysis
Mobile Networks and Applications - Special issue: protocols for mobile environments
The Complexity of Planar Counting Problems
SIAM Journal on Computing
An embedded DRAM architecture for large-scale spatial-lattice computations
Proceedings of the 27th annual international symposium on Computer architecture
A brief history of cellular automata
ACM Computing Surveys (CSUR)
Effects of interaction topology and activation regime in several mutli-agent systems
MABS 2000 Proceedings of the second international workshop on Multi-agent based simulation
Discrete, sequential dynamical systems
Discrete Mathematics
Regular Article: Equivalence Relations on Finite Dynamical Systems
Advances in Applied Mathematics
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
Regular Article: On Acyclic Orientations and Sequential Dynamical Systems
Advances in Applied Mathematics
On the complexity of verifying concurrent transition systems
Information and Computation
Which problems have strongly exponential complexity?
Journal of Computer and System Sciences
Switching and Finite Automata Theory: Computer Science Series
Switching and Finite Automata Theory: Computer Science Series
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Complexity of Counting in Sparse, Regular, and Planar Graphs
SIAM Journal on Computing
Tractable Dataflow Analysis for Distributed Systems
IEEE Transactions on Software Engineering
Computational complexity of neural networks: a survey
Nordic Journal of Computing
Treewidth: Algorithmoc Techniques and Results
MFCS '97 Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science
Towards a Predictive Computational Complexity Theory
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
On the Complexity of Relational Problems for Finite State Processes (Extended Abstract)
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Processing of Hierarchically Defined Graphs and Graph Families
Data Structures and Efficient Algorithms, Final Report on the DFG Special Joint Initiative
Very Large Scale Spatial Computing
UMC '02 Proceedings of the Third International Conference on Unconventional Models of Computation
Reachability problems for sequential dynamical systems with threshold functions
Theoretical Computer Science - Mathematical foundations of computer science
Decomposition and simulation of sequential dynamical systems
Advances in Applied Mathematics
Constraint Satisfaction: The Approximability of Minimization Problems
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
An FPGA architecture for DRAM-based systolic computations
FCCM '97 Proceedings of the 5th IEEE Symposium on FPGA-Based Custom Computing Machines
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Generative Social Science: Studies in Agent-Based Computational Modeling (Princeton Studies in Complexity)
Computer
Attraction radii in binary hopfield nets are hard to compute
Neural Computation
On computational complexity of counting fixed points in symmetric boolean graph automata
UC'05 Proceedings of the 4th international conference on Unconventional Computation
Influential nodes in a diffusion model for social networks
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Factor graphs and the sum-product algorithm
IEEE Transactions on Information Theory
Membrane Computing
Modeling and analyzing social network dynamics using stochastic discrete graphical dynamical systems
Theoretical Computer Science
Finding a Periodic Attractor of a Boolean Network
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
| Hi-index | 5.23 |
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.