AbstractWe first show that the parallel evolution of a network of automata N can be sequentially simulated by another network N′ whose local transition functions are the same as those of N. This result is used to unify and generalize some results on the dynamic behaviour of finite automata networks
Cellular automata (CA) are an abstract model of a distributed dynamical system, as well as of fine-g...
This paper extends automata-theoretic techniques to unbounded parallel behaviour, as seen for instan...
AbstractA model of large assemblies of computing elements is provided by the concept of boolean netw...
AbstractWe first show that the parallel evolution of a network of automata N can be sequentially sim...
AbstractThe purpose of this paper is twofold: to give a precise notion of a realization for simulati...
We present simulation mechanisms by which any network of threshold logic units with either symmetric...
International audienceAutomata networks are often conceived as a finite generalization of cellular a...
International audienceIn this article we consider finite automata networks (ANs) with two kinds of u...
Automata networks model all finite discrete dynamics. Each automaton has a state, evolving in discre...
An automata network (AN) is a finite graph where each node holds a state from a finite alphabet and ...
AbstractA concurrent automaton (c.a.) A = (I, O, S, →) consists of sets of input- (I) and output-lin...
Abstract. A parallel communicating finite automata system is an accepting device based on the commun...
Abstract. We investigate the descriptive succinctness of three fundamental notions for modeling conc...
AbstractThis paper deals with finite size networks which consist of interconnections of synchronousl...
This work deals with automata systems. We define parallel automata systems and parallel communicatin...
Cellular automata (CA) are an abstract model of a distributed dynamical system, as well as of fine-g...
This paper extends automata-theoretic techniques to unbounded parallel behaviour, as seen for instan...
AbstractA model of large assemblies of computing elements is provided by the concept of boolean netw...
AbstractWe first show that the parallel evolution of a network of automata N can be sequentially sim...
AbstractThe purpose of this paper is twofold: to give a precise notion of a realization for simulati...
We present simulation mechanisms by which any network of threshold logic units with either symmetric...
International audienceAutomata networks are often conceived as a finite generalization of cellular a...
International audienceIn this article we consider finite automata networks (ANs) with two kinds of u...
Automata networks model all finite discrete dynamics. Each automaton has a state, evolving in discre...
An automata network (AN) is a finite graph where each node holds a state from a finite alphabet and ...
AbstractA concurrent automaton (c.a.) A = (I, O, S, →) consists of sets of input- (I) and output-lin...
Abstract. A parallel communicating finite automata system is an accepting device based on the commun...
Abstract. We investigate the descriptive succinctness of three fundamental notions for modeling conc...
AbstractThis paper deals with finite size networks which consist of interconnections of synchronousl...
This work deals with automata systems. We define parallel automata systems and parallel communicatin...
Cellular automata (CA) are an abstract model of a distributed dynamical system, as well as of fine-g...
This paper extends automata-theoretic techniques to unbounded parallel behaviour, as seen for instan...
AbstractA model of large assemblies of computing elements is provided by the concept of boolean netw...
DOI
Add to ORKG