Elements of a theory of simulation. II: Sequential dynamical systems.

DOI10.1016/S0096-3003(98)10114-5zbMath1049.68149OpenAlexW1986397639WikidataQ56266977 ScholiaQ56266977MaRDI QIDQ1569128

Christian M. Reidys, Christopher L. Barrett, Henning S. Mortveit

Publication date: 25 June 2000

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0096-3003(98)10114-5

zbMATH Keywords

Fixed pointsStructureOrderingsSequential dynamical systems

Mathematics Subject Classification ID

Related Items (44)

Indiscernibility structures induced from function sets : Graph and digraph case ⋮ A new discrete dynamical system of signed integer partitions ⋮ Computation of functions on \(n\) bits by asynchronous clocking of cellular automata ⋮ The adjacency matrix of a graph as a data table: a geometric perspective ⋮ Discrete dynamical systems on graphs and Boolean functions ⋮ On the dynamics of semilattice networks ⋮ Linear sequential dynamical systems, incidence algebras, and Möbius functions ⋮ Parallel and sequential dynamics of two discrete models of signed integer partitions ⋮ Computational complexity studies of synchronous Boolean finite dynamical systems on directed graphs ⋮ Fixed points in generalized parallel and sequential dynamical systems induced by a minterm or maxterm Boolean functions ⋮ Computational Complexity Studies of Synchronous Boolean Finite Dynamical Systems ⋮ Parallel discrete dynamical systems on maxterm and minterm Boolean functions ⋮ Dependency and accuracy measures for directed graphs ⋮ Synchronous Boolean finite dynamical systems on directed graphs over XOR functions ⋮ Threshold agent networks: An approach to modelling and simulation ⋮ Decomposition and simulation of sequential dynamical systems ⋮ Parallel dynamical systems over directed dependency graphs ⋮ Generalized predecessor existence problems for Boolean finite dynamical systems on directed graphs ⋮ Agent-Based Modeling, Mathematical Formalism for ⋮ Normal form in Hecke-Kiselman monoids associated with simple oriented graphs ⋮ Existence, coexistence and uniqueness of fixed points in parallel and sequential dynamical systems over directed graphs ⋮ Predecessors and Garden-of-Eden configurations in parallel dynamical systems on maxterm and minterm Boolean functions ⋮ Updating method for the computation of orbits in parallel and sequential dynamical systems ⋮ Parallel dynamical systems over special digraph classes ⋮ Neutrality in fitness landscapes. ⋮ Dichotomy results for fixed point counting in Boolean dynamical systems ⋮ Equivalence relations on finite dynamical systems ⋮ Matrix method for linear sequential dynamical systems on digraphs ⋮ Sequential dynamical systems over words ⋮ Modeling and analyzing social network dynamics using stochastic discrete graphical dynamical systems ⋮ Update schedules of sequential dynamical systems ⋮ Dynamical attraction in parallel network models ⋮ Flexible toggles and symmetric invertible asynchronous elementary cellular automata ⋮ On periods and equilibria of computational sequential systems ⋮ Synchronous Boolean Finite Dynamical Systems on Directed Graphs over XOR Functions ⋮ Enumerating periodic orbits in sequential dynamical systems over graphs ⋮ ON THE COMPLEXITY OF COUNTING FIXED POINTS AND GARDENS OF EDEN IN SEQUENTIAL DYNAMICAL SYSTEMS ON PLANAR BIPARTITE GRAPHS ⋮ Generalized Predecessor Existence Problems for Boolean Finite Dynamical Systems ⋮ Parallel dynamical systems over graphs and related topics: a survey ⋮ Elements of a theory of simulation. III: Equivalence of SDS. ⋮ ETS IV: Sequential dynamical systems: fixed points, invertibility and equivalence ⋮ On acyclic orientations and sequential dynamical systems ⋮ A graph-dynamical interpretation of Kiselman's semigroups ⋮ Attractors and transient in sequential dynamical systems

Cites Work

• Unnamed Item
• Unnamed Item
• Acyclic orientations of random graphs
• Elements of a theory of computer simulation. I
• Global versus local asymptotic theories of finite-dimensional normed spaces
• Discrete, sequential dynamical systems
• Elements of a theory of simulation. III: Equivalence of SDS.
• Acyclic orientations of graphs
• Bounds on the chromatic polynomial and on the number of acyclic orientations of a graph
• The Effect of Number of Hamiltonian Paths on the Complexity of a Vertex-Coloring Problem
• Hard Enumeration Problems in Geometry and Combinatorics
• Information Bounds Are Weak in the Shortest Distance Problem
• Optimal Randomized Algorithms for Local Sorting and Set-Maxima
• REDUCTION OF DISCRETE DYNAMICAL SYSTEMS OVER GRAPHS

This page was built for publication: Elements of a theory of simulation. II: Sequential dynamical systems.