Filters








700 Hits in 10.6 sec

ASYNCHRONOUS AUTOMATA NETWORKS CAN EMULATE ANY SYNCHRONOUS AUTOMATA NETWORK

CHRYSTOPHER L. NEHANIV
2004 International journal of algebra and computation  
This establishes that the behavior of any (locally finite) synchronous automata network actually can be emulated without the restriction of synchronous update, freeing us from the need of a global clock  ...  We show that any locally finite automata network A with global synchronous updates can be emulated by another one A, whose structure derives from that of A by a simple construction, but whose updates are  ...  (Asynchronous Emulation of Synchronous Automata Networks) Let any synchronous automata network A over a locally finite digraph Γ = (V, E) with local automata A v = (Q v , X v , δ v ) (v ∈ V ) and external  ... 
doi:10.1142/s0218196704002043 fatcat:uryliaydd5frtbsj7o5sniqfzy

Self-replication, Evolvability and Asynchronicity in Stochastic Worlds [chapter]

Chrystopher L. Nehaniv
2005 Lecture Notes in Computer Science  
Formal views of self-reproduction and time are surveyed, and a general asynchronization construction for automata networks is presented.  ...  Developmental genetic regulatory networks (DGRNs) are suggested as a novel paradigm for massive asynchronous computation and evolvability.  ...  Except where stated, the ideas and results expressed in this paper, together with any shortcomings, are the author's own.  ... 
doi:10.1007/11571155_13 fatcat:4cdihrzr5reljbhedfxh67v47y

Checking equivalences between concurrent systems of finite agents (Extended abstract) [chapter]

Alexander Rabinovich
1992 Lecture Notes in Computer Science  
Consider two synchronously communicating systems p and q over finite agents. Assume that one wants to check whether p ,~ q for one of the commonly used equivalences.  ...  Dataflow nets are the simplest systems of asynchronously communicating agents. Let ", be an equivalence which lies between strong bisimulation and trace equivalences.  ...  Language equivMence is defined on automata like in classical automata theory. 3 Synchronization and hiding can be defined in a natural way on the automata.  ... 
doi:10.1007/3-540-55719-9_115 fatcat:ugccyukyojffvhxiqnzolpwpqy

A guided tour of asynchronous cellular automata [article]

Nazim Fatès
2014 arXiv   pre-print
Research on asynchronous cellular automata has received a great amount of attention these last years and has turned to a thriving field.  ...  The author knows how much he owes to them, including the organisers of Automata'13 and their precious support, and the anonymous referees, whose constructive propositions were greatly appreciated.  ...  Automata networks, neural networks and other models The effect of asynchronous updating in genetic regulatory networks has also been investigated by many authors.  ... 
arXiv:1406.0792v2 fatcat:xa4rqwvixngebfh3coo3gwnmtm

A Guided Tour of Asynchronous Cellular Automata [chapter]

Nazim Fatès
2013 Lecture Notes in Computer Science  
Research on asynchronous cellular automata has received a great amount of attention these last years and has turned to a thriving field.  ...  The author knows how much he owes to them, including the organisers of Automata'13 and their precious support, and  ...  Automata networks, neural networks and other models The effect of asynchronous updating in genetic regulatory networks has also been investigated by many authors.  ... 
doi:10.1007/978-3-642-40867-0_2 fatcat:cqurycl4p5g3fii6cn33mljvfe

The virtual node layer

Matthew Brown, Seth Gilbert, Nancy Lynch, Calvin Newport, Tina Nolte, Michael Spindel
2007 ACM SIGBED Review  
The Virtual Node Layer (VNLayer) programming abstraction provides programmable, predictable automata-virtual nodes-emulated by the low-level network nodes.  ...  This simplifies the design and rigorous analysis of applications for the wireless sensor network setting, as the layer can mask much of the uncertainty of the underlying components.  ...  In the VNLayer of [8] , the VNs are untimed asynchronous automata moving along pre-defined trajectories, known to all CNs.  ... 
doi:10.1145/1317103.1317105 fatcat:tvy2w2mb2rhnfjtkh4sjsh4bai

RAMBO: A Reconfigurable Atomic Memory Service for Dynamic Networks [chapter]

Nancy Lynch, Alex A. Shvartsman
2002 Lecture Notes in Computer Science  
The service emulates atomic read/write shared objects in the dynamic setting where processors can arbitrarily crash, or join and leave the computation.  ...  This paper presents a framework that was developed for translating algorithms specified as Input/Output Automata (IOA) to distributed programs.  ...  Given that any consensus algorithm can be used with RAMBO, we do not discuss this further. In the remainder we discuss several optimizations of RAMBO.  ... 
doi:10.1007/3-540-36108-1_12 fatcat:whq3jo3tuffknkm4oq46lviydq

Emergence and Control of Macro-Spatial Structures in Perturbed Cellular Automata, and Implications for Pervasive Computing Systems

M. Mamei, A. Roli, F. Zambonelli
2005 IEEE transactions on systems, man and cybernetics. Part A. Systems and humans  
In this context, this paper describes the general behavior observed in a large set of asynchronous cellular automata when external perturbations influence the internal activities of cellular automata cells  ...  On this basis, the paper also reports the results of a set of experiments, showing how it is possible to control, in a decentralized way, the behavior of perturbed cellular automata, to make any desired  ...  Fig. 1 . 1 Synchronous versus asynchronous dynamics in CA.  ... 
doi:10.1109/tsmca.2005.846379 fatcat:wgjasrbwhzclbeflf5lujvsdfe

Deducing Local Rules for Solving Global Tasks with Random Boolean Networks [article]

Bertrand Mesot, Christof Teuscher
2006 arXiv   pre-print
Here we present a novel analytical approach to find the local rules of random Boolean networks (RBNs) to solve the global density classification and the synchronization task from any initial configuration  ...  It has been shown that uniform as well as non-uniform cellular automata (CA) can be evolved to perform certain computational tasks.  ...  Asynchronous automata attracted much interest in the past few years, although it has been proved independently by Capcarrère [13] and Nehaniv [33] that any n-state synchronous automata can be emulated  ... 
arXiv:cond-mat/0606632v1 fatcat:n4hqep5mkbeqbko5qioccoopvq

Programming and simulating chemical reaction networks on a surface

Samuel Clamons, Lulu Qian, Erik Winfree
2020 Journal of the Royal Society Interface  
Expanding on the constructions in that work, we first demonstrate that surface CRNs can emulate asynchronous and synchronous deterministic cellular automata and implement continuously active Boolean logic  ...  Models of well-mixed chemical reaction networks (CRN) have provided a solid foundation for the study of programmable molecular systems, but the importance of spatial organization in such systems has increasingly  ...  Can a surface CRN, which is intrinsically asynchronous, emulate the function of a truly synchronous cellular automaton? 3.2.  ... 
doi:10.1098/rsif.2019.0790 pmid:32453979 fatcat:nzzxfkyje5dbhf7oewfipkmg3a

Emulating Cellular Automata in Chemical Reaction-Diffusion Networks [chapter]

Dominic Scalise, Rebecca Schulman
2014 Lecture Notes in Computer Science  
Here we show that given simple, periodic inputs, chemical reactions and diffusion can reliably emulate the dynamics of a deterministic cellular automaton, and can therefore be programmed to produce a wide  ...  Reaction-diffusion based cellular automata could potentially be built in vitro using networks of DNA molecules that interact via branch migration processes and could in principle perform universal computation  ...  We call these molecules Emulating cellular automata in chemical reaction-diffusion networks 'keys.'  ... 
doi:10.1007/978-3-319-11295-4_5 fatcat:4cgcupeig5hcpnlaolimr2335i

Emulating cellular automata in chemical reaction–diffusion networks

Dominic Scalise, Rebecca Schulman
2015 Natural Computing  
Here we show that given simple, periodic inputs, chemical reactions and diffusion can reliably emulate the dynamics of a deterministic cellular automaton, and can therefore be programmed to produce a wide  ...  Reaction-diffusion based cellular automata could potentially be built in vitro using networks of DNA molecules that interact via branch migration processes and could in principle perform universal computation  ...  We call these molecules Emulating cellular automata in chemical reaction-diffusion networks 'keys.'  ... 
doi:10.1007/s11047-015-9503-8 fatcat:4srwdynynrbrbe3qfvmqkjvjpu

Abstracts of Current Computer Literature1 (415) 1623

1971 IEEE transactions on computers  
An asynchronous control network is described by a directed graph G[N] called the control network graph.  ...  After defining the structural and behavioral properties of asynchronous control modules, this idea is extended to include asynchronous control networks.  ... 
doi:10.1109/t-c.1971.223194 fatcat:hh2wp6alenexvpphuet7losv7e

Generative Network Automata: A Generalized Framework for Modeling Complex Dynamical Systems with Autonomously Varying Topologies

Hiroki Sayama
2007 2007 IEEE Symposium on Artificial Life  
We propose a new modeling framework "Generative Network Automata (GNA)" that can uniformly describe both state transitions and autonomous topology transformations of complex dynamical networks.  ...  local network states and topologies.  ...  Since asynchronous automata networks can emulate any synchronous automata networks [41] , the GNA framework covers the whole class of dynamics that can be produced by conventional dynamical network models  ... 
doi:10.1109/alife.2007.367799 dblp:conf/ieeealife/Sayama07 fatcat:wswvczjecbbffdnsmtgqbrwcty

An FPGA Implementation of a Distributed Virtual Machine [chapter]

Lee A. Jensen, Lance R. Williams
2018 Lecture Notes in Computer Science  
This was accomplished by compiling a VHDL specification of a special purpose distributed memory multicomputer with a mesh interconnection network into a globally asynchronous, locally synchronous (GALS  ...  Because they can be implemented as asynchronous circuits, DVMs also address the well known problem a↵ecting traditional machine architectures implemented as integrated circuits, namely, clock networks  ...  cellular automata to emulate synchronous cellular automata with negligible slowdown [8] .  ... 
doi:10.1007/978-3-319-92435-9_8 fatcat:dtkxp2mgezbzdaj4qqqq64xl2u
« Previous Showing results 1 — 15 out of 700 results