Asynchronous, finite dynamical systems
From MaRDI portal
Publication:6535742
DOI10.1007/s11047-023-09944-3zbMATH Open1547.37054MaRDI QIDQ6535742
Publication date: 9 February 2024
Published in: Natural Computing (Search for Journal in Brave)
schedulingfinite dynamical systemsBoolean networksacyclic orientationsasynchronousstructure-to-function theory
Combinatorial dynamics (types of periodic orbits) (37E15) Dynamical systems involving maps of trees and graphs (37E25) Switching theory, applications of Boolean algebras to circuits and networks (94C11)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An atlas of limit set dynamics for asynchronous elementary cellular automata
- Dynamics groups of asynchronous cellular automata
- Combinatorics on update digraphs in Boolean networks
- Posets from admissible Coxeter sequences.
- Complexity of reachability problems for finite discrete dynamical systems
- An introduction to sequential dynamical systems
- Classes of cycle bases
- Enumerating degree sequences in digraphs and a cycle--cocycle reversing system
- Conjugacy of Coxeter elements.
- Acyclic orientations of random graphs
- Discrete, sequential dynamical systems
- Syzygies of oriented matroids
- \#P-completeness of counting update digraphs, cacti, and series-parallel decomposition method
- Non-maximal sensitivity to synchronism in elementary cellular automata: exact asymptotic measures
- Attractor stability in finite asynchronous biological system models
- Combinatorial problems of commutation and rearrangements
- Toric partial orders
- A Guided Tour of Asynchronous Cellular Automata
- Order Independence in Asynchronous Cellular Automata
- On enumeration of conjugacy classes of Coxeter elements
- Cycle equivalence of graph dynamical systems
- On the computational complexity of the Jones and Tutte polynomials
- Conjugacy relation on Coxeter elements
- A tutorial on elementary cellular automata with fully asynchronous updating. General properties and convergence dynamics
- Lipschitz continuity under toric equivalence for asynchronous Boolean networks
This page was built for publication: Asynchronous, finite dynamical systems
