ASYNCHRONOUS AUTOMATA NETWORKS CAN EMULATE ANY SYNCHRONOUS AUTOMATA NETWORK
نویسندگان
چکیده
منابع مشابه
Asynchronous Automata Networks Can Emulate any Synchronous Automata Network
We show that any locally finite automata network A with global synchronous updates can be emulated by another one Â, whose structure derives from that of A by a simple construction, but whose updates are made asynchronously at its various component automata (e.g., possibly randomly or sequentially, with or without possible simultaneous updates at different nodes). By “emulatation”, we refer to ...
متن کاملDistributing Automata for Asynchronous Networks of Processors
This paper addresses the problem of distributed program synthesis. In the rst part, we formalize the distribution process and prove its correctness, i.e. that the initial centralized program's behavior is equivalent to the corresponding distributed's one. In order to achieve that, we rst represent the program by a nite transition system, labeled by the program's actions. Then we derive an indep...
متن کاملSynchronous and Asynchronous Learning by Responsive Learning Automata
We consider the ability of economic agents to learn in a decentralized environment in which agents do not know the (stochastic) payoo matrix and can not observe their opponents' actions; they merely know, at each stage of the game, their own action and the resulting payoo. We discuss the requirements for learning in such an environment, and show that a simple probabilistic learning algorithm sa...
متن کاملImplementing Realistic Asynchronous Automata
Zielonka’s theorem, established 25 years ago, states that any regular language closed under commutation is the language of an asynchronous automaton (a tuple of automata, one per process, exchanging information when performing common actions). Since then, constructing asynchronous automata has been simplified and improved [6, 20, 7, 12, 8, 4, 2, 21, 22]. We first survey these constructions and ...
متن کاملAsynchronous cellular learning automata
Cellular learning automata is a combination of cellular automata and learning automata. The synchronous version of cellular learning automata in which all learning automata in different cells are activated synchronously, has found many applications. In some applications a type of cellular learning automata in which learning automata in different cells are activated asynchronously (asynchronous ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Algebra and Computation
سال: 2004
ISSN: 0218-1967,1793-6500
DOI: 10.1142/s0218196704002043