Complexity of reachability problems for finite discrete dynamical systems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4058875 (Why is no real title available?)
- scientific article; zbMATH DE number 4070331 (Why is no real title available?)
- scientific article; zbMATH DE number 4074492 (Why is no real title available?)
- scientific article; zbMATH DE number 21231 (Why is no real title available?)
- scientific article; zbMATH DE number 149060 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1296290 (Why is no real title available?)
- scientific article; zbMATH DE number 566078 (Why is no real title available?)
- scientific article; zbMATH DE number 1741013 (Why is no real title available?)
- scientific article; zbMATH DE number 1848281 (Why is no real title available?)
- scientific article; zbMATH DE number 2102770 (Why is no real title available?)
- scientific article; zbMATH DE number 816973 (Why is no real title available?)
- scientific article; zbMATH DE number 1405664 (Why is no real title available?)
- scientific article; zbMATH DE number 3328721 (Why is no real title available?)
- A Theory of Communicating Sequential Processes
- Adversarial models in evolutionary game dynamics
- Asynchronous automata versus asynchronous cellular automata
- Cellular automata and the sciences of complexity. A review of some outstanding problems in the theory of cellular automata.
- Computability with low-dimensional dynamical systems
- Decomposition and simulation of sequential dynamical systems
- Discrete, sequential dynamical systems
- Elements of a theory of computer simulation. I
- Elements of a theory of simulation. III: Equivalence of SDS.
- Equivalence relations on finite dynamical systems
- Evolutionary games and computer simulations.
- Finite automata-models for the investigation of dynamical systems
- General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results
- Generalized shifts: unpredictability and undecidability in dynamical systems
- Inversion of 2D cellular automata: Some complexity results
- On Communicating Finite-State Machines
- On acyclic orientations and sequential dynamical systems
- On some relations between dynamical systems and transition systems
- On the Limit Sets of Cellular Automata
- On the complexity of verifying concurrent transition systems
- On the computational complexity of finite cellular automata
- On the computational power of dynamical systems and hybrid systems
- On the computational power of neural nets
- On the computational power of totalistic cellular automata
- On totalistic systolic networks
- One-way cellular automata on Cayley graphs
- Proving liveness for networks of communicating finite state machines
- Reachability analysis of dynamical systems having piecewise-constant derivatives
- Reachability problems for sequential dynamical systems with threshold functions.
- Simulating quadratic dynamical systems is PSPACE-complete (preliminary version)
- Transient length in sequential iteration of threshold functions
- Unpredictability and undecidability in dynamical systems
Cited in
(30)- Generalized predecessor existence problems for Boolean finite dynamical systems on directed graphs
- scientific article; zbMATH DE number 1241943 (Why is no real title available?)
- Complexity results for reachability in cooperating systems and approximated reachability by abstract over-approximations
- Complexity of inferring local transition functions of discrete dynamical systems
- Synchronous Boolean Finite Dynamical Systems on Directed Graphs over XOR Functions
- A framework for simulating multiple contagions over multiple networks
- The hardness of local certification of finite-state dynamics
- UNCERTAINTY VISUALIZATION FOR CHARACTERIZING HETEROGENEOUS HUMAN BEHAVIORS IN DISCRETE DYNAMICAL SYSTEM MODELS
- Intrinsic universality in automata networks. II: Glueing and gadgets
- Reversible iterative graph processes
- Dichotomy results for fixed point counting in Boolean dynamical systems
- Does the lit-only restriction make any difference for the \(\sigma \)-game and \(\sigma ^+\)-game?
- scientific article; zbMATH DE number 1848281 (Why is no real title available?)
- Agent-based modeling, mathematical formalism for
- Asynchronous, finite dynamical systems
- On the Quantifier-Free Dynamic Complexity of Reachability
- Modeling and analyzing social network dynamics using stochastic discrete graphical dynamical systems
- Generalized predecessor existence problems for Boolean finite dynamical systems
- Inhibiting diffusion of complex contagions in social networks: theoretical and experimental results
- Inferring local transition functions of discrete dynamical systems from observations of system behavior
- A note on the undecidability of the reachability problem for o-minimal dynamical systems
- Computational complexity studies of synchronous Boolean finite dynamical systems on directed graphs
- Reachability problems for sequential dynamical systems with threshold functions.
- Synchronous Boolean finite dynamical systems on directed graphs over XOR functions
- scientific article; zbMATH DE number 7724206 (Why is no real title available?)
- A computational study of \(f\)-reversible processes on graphs
- Computational complexity studies of synchronous Boolean finite dynamical systems
- Complexity of local, global and universality properties in finite dynamical systems
- Attractor stability in nonuniform Boolean networks
- Limit cycle structure for dynamic bi-threshold systems
This page was built for publication: Complexity of reachability problems for finite discrete dynamical systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q856411)
