ASYNCHRONOUS AUTOMATA NETWORKS CAN EMULATE ANY SYNCHRONOUS AUTOMATA NETWORK
From MaRDI portal
Publication:4658708
DOI10.1142/S0218196704002043zbMath1088.68127MaRDI QIDQ4658708
Publication date: 18 March 2005
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Discrete dynamical systems; local time; generalized cellular automata and networks; products of automata over locally finite digraphs
05C90: Applications of graph theory
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
68Q80: Cellular automata (computational aspects)
Related Items
Programming in Biomolecular Computation, Emulating cellular automata in chemical reaction-diffusion networks, Modeling complex systems with adaptive networks, FINDING ATTRACTORS IN ASYNCHRONOUS BOOLEAN DYNAMICS
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computation on binary tree-networks
- Complete classes of automata for the \(\alpha _ 0\)-product
- Parallel calculation of a linear mapping on a computer network
- Parallel realization of permutations over trees
- Analysis and identification of speed-independent circuits on an event model
- Delay-insensitivity and ternary simulation
- On complete systems of automata
- Computation of Boolean functions on networks of binary automata
- Permutation Factorization on Star-Connected Networks of Binary Automata