ASYNCHRONOUS AUTOMATA NETWORKS CAN EMULATE ANY SYNCHRONOUS AUTOMATA NETWORK

DOI10.1142/S0218196704002043zbMath1088.68127MaRDI QIDQ4658708

Chrystopher L. Nehaniv

Publication date: 18 March 2005

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

zbMATH Keywords

Discrete dynamical systemslocal timegeneralized cellular automata and networksproducts of automata over locally finite digraphs

Mathematics Subject Classification ID

Applications of graph theory (05C90) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Cellular automata (computational aspects) (68Q80)

Related Items (4)

Modeling complex systems with adaptive networks ⋮ Programming in Biomolecular Computation ⋮ FINDING ATTRACTORS IN ASYNCHRONOUS BOOLEAN DYNAMICS ⋮ Emulating cellular automata in chemical reaction-diffusion networks

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

This page was built for publication: ASYNCHRONOUS AUTOMATA NETWORKS CAN EMULATE ANY SYNCHRONOUS AUTOMATA NETWORK