1,908 Hits in 3.7 sec

On the Expressiveness of Asynchronous Cellular Automata [chapter]

Benedikt Bollig
2005 Lecture Notes in Computer Science  
We show that a slightly extended version of asynchronous cellular automata, relative to any class of pomsets and dags without autoconcurrency, has the same expressive power as the existential fragment  ...  In doing so, we provide a framework that unifies many approaches to modeling distributed systems such as the models of asynchronous trace automata and communicating finite-state machines.  ...  Statement (1) follows from [1] and (2) follows from [11] and the fact that DAG( Σ) is the language of an ACA relative to DAG(({a}) a∈Σ ).  ... 
doi:10.1007/11537311_46 fatcat:tcu5zfn36bdexi5jlad4t5nr5e

Hierarchy of Asynchronous Automata

2000 Electronical Notes in Theoretical Computer Science  
of asynchronous automata.  ...  We nally apply this method to asynchronous automata which describe systems of processes that communicate through shared memories.  ...  Thanks to the constructive criticism of some anonymous referees on a previous version of this paper, we could improve the presentation of our results.  ... 
doi:10.1016/s1571-0661(05)80628-0 fatcat:sk5qfjqd65fejckzakb6cehklu

Page 7821 of Mathematical Reviews Vol. , Issue 97M [page]

1997 Mathematical Reviews  
These constructions can both be adapted for the case of the closely related asynchronous (non-cellular) automata.  ...  Szuster (Lublin) 97m:68145 68Q68 68Q10 68Q80 Muscholl, Anca (D-STGT-I; Stuttgart) On the complementation of asynchronous cellular Biichi automata. (English summary) ICALP °94 (Jerusalem, 1994).  ... 

Page 4547 of Mathematical Reviews Vol. , Issue 93h [page]

1993 Mathematical Reviews  
(1-CRNL-E) Effect of noise on long-term memory in cellular automata with asynchronous delays between the processors.  ...  long-term memory in cellular automata, and describes when asynchronism can cause the erasure of long-term memory in the presence of noise.  ... 

Foreword: cellular automata and applications

Alberto Dennunzio, Enrico Formenti
2013 Natural Computing  
The paper ''Computation of Functions on n Bits by Asynchronous Clocking Cellular Automata'' by Michael Vielhaber aims at proving that different functions on binary vectors can be computed by changing the  ...  The implementation of cellular automata on processor arrays is considered by Jean-Vivien Millo and Robert de Simone in the paper ''Explicit routing schemes for implementation of cellular automata on processor  ... 
doi:10.1007/s11047-013-9377-6 fatcat:k77fy3rzzjds5bh4ahkv23tnhq

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.  ...  We survey the recent research that has been carried out on this topic and present a wide state of the art where computing and modelling issues are both represented.  ...  Acknowledgements May all the persons that have contributed to the elaboration of this text receive our sincere expression of gratefulness.  ... 
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.  ...  and extended version of the invited paper  ...  Acknowledgements May all the persons that have contributed to the elaboration of this text receive our sincere expression of gratefulness.  ... 
doi:10.1007/978-3-642-40867-0_2 fatcat:cqurycl4p5g3fii6cn33mljvfe

Page 1759 of Mathematical Reviews Vol. , Issue 95c [page]

1995 Mathematical Reviews  
An additive (“totalistic”) cellular automaton (CA) is one in which the local next-state function depends only on the sum of states (regarded as natural numbers) of neighborhood-cells.  ...  The motivation of this paper is to rework a notion of asynchronous automata introduced by Zielonka [RAIRO Inform. Théor.  ... 

Asynchronous, irregular automata nets: the path not taken

W.Richard Stark, William H. Hughes
2000 Biosystems (Amsterdam. Print)  
Sections 1 and 2 review the early history of von Neumann's attempt explore biological information processing and finally the emergence of cellular automata.  ...  Section 3 defines and explores examples of cellular automata and artificial tissue.  ...  A few webpages on the Game of Life and cellular automata, with links to others, are given in (WWW pages on cellular automata).The ripple adder is a linear array of cells: …(n + l),…,+1, 0, − 1,…, (n− 1  ... 
doi:10.1016/s0303-2647(99)00088-x pmid:10745114 fatcat:7xvklkuvvjgzblshacbwb3biey

Page 1430 of Mathematical Reviews Vol. , Issue 2000b [page]

2000 Mathematical Reviews  
We show that the expressiveness of monadic second-order logic and that of asynchronous cellular automata are different in the class of all pomsets without autoconcurrency.  ...  The universality and the equivalence of asynchronous automata for pomsets are proved to be decidable, but this is shown not to be the case for asynchronous cellular automata.”  ... 

Robustness of Cellular Automata in the Light of Asynchronous Information Transmission [chapter]

Olivier Bouré, Nazim Fatès, Vincent Chevrier
2011 Lecture Notes in Computer Science  
Cellular automata are classically synchronous: all cells are simultaneously updated.  ...  This paper presents a new type of asynchronism, the β-synchronism, where cells still update at each time step but where the transmission of information between cells is disrupted randomly.  ...  This extension is a first step towards a unified view of asynchronism for cellular automata, based on the idea of cell cycles. There exist plenty of other ways the cellular activity can be perturbed.  ... 
doi:10.1007/978-3-642-21341-0_11 fatcat:qhny226et5bxth5n2ohnf7wbeu

On the complementation of asynchronous cellular Büchi automata

Anca Muscholl
1996 Theoretical Computer Science  
We present direct subset automata constructions for asynchronous (asynchronous cellular, resp.) automata.  ...  We use the subset automaton construction and apply Klarlund's progress measure technique in order to complement non-deterministic asynchronous cellular Biichi automata for infinite traces.  ...  I also thank the referees from ICALP'93 and especially from Theoretical Computer Science for the comments which led to an improved presentation of this paper.  ... 
doi:10.1016/s0304-3975(96)00117-x fatcat:74ywotnkjffs3fyybgocud4dda

Probing robustness of cellular automata through variations of asynchronous updating

Olivier Bouré, Nazim Fatès, Vincent Chevrier
2012 Natural Computing  
We then use the novel updating schemes to probe the behaviour of Elementary Cellular Automata, and observe a wide variety of results.  ...  Typically viewed as a deterministic model of spatial computing, cellular automata are here considered as a collective system subject to the noise inherent to natural computing.  ...  Preliminary observations We now apply β-and γ-synchronism to one of the simplest classes of cellular automata, the Elementary Cellular Automata, and compare the resulting behaviours 1 to the dynamics of  ... 
doi:10.1007/s11047-012-9340-y fatcat:wl5g446w7fhvtkd5xjkgtpzcbm

Computational Power of Asynchronously Tuned Automata Enhancing the Unfolded Edge of Chaos

Yukio-Pegio Gunji, Daisuke Uragami
2021 Entropy  
Asynchronously tuned elementary cellular automata (AT-ECA) are described with respect to the relationship between active and passive updating, and that spells out the relationship between synchronous and  ...  Since asynchronous tuning easily makes behavior at the edge of chaos, the property of AT-ECA is called the unfolded edge of chaos.  ...  Conflicts of Interest: The authors declare no conflict of interest.  ... 
doi:10.3390/e23111376 pmid:34828074 pmcid:PMC8622964 fatcat:di7icujuwzcdpc7qpgvjriee3a

Cryptographic Key Exchange Protocol with Message Authentication Codes (MAC) Using Finite State Machine

Mohd Anuar Mat Isa, Miza Mumtaz Ahmad, Nor Fazlida Mohd Sani, Habibah Hashim, Ramlan Mahmod
2014 Procedia Computer Science  
We divided our MAC protocol into three stages of communication sequences in order to simplify the model and the design of automata machine.  ...  We propose a new MAC scheme model using input-output automata to protect the integrity of the secret key in the key exchange protocol.  ...  Acknowledgements The authors would like to acknowledge the Ministry of Education (MOE) Malaysia for providing the grant 600-RMI/NRGS 5/3 (5/2013), and Universiti Teknologi MARA (UiTM) for supporting this  ... 
doi:10.1016/j.procs.2014.11.061 fatcat:nx6wknnztzcqrl6hhskyp5frxu
« Previous Showing results 1 — 15 out of 1,908 results