Filters








440 Hits in 2.8 sec

Asynchronous automata versus asynchronous cellular automata

Giovanni Pighizzini
1994 Theoretical Computer Science  
., Asynchronous automata versus asynchronous cellular automata, Theoretical Computer Science, 132 (1994) 179-207.  ...  Acknowledgment I am indebted to the anonymous referees for helpful comments.  ...  We obtain a similar result also for asynchronous cellular automata.  ... 
doi:10.1016/0304-3975(94)90232-1 fatcat:xjmvv3zhavh6xi4me4o3jrg6ku

On the complementation of asynchronous cellular Büchi automata

Anca Muscholl
1996 Theoretical Computer Science  
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.  ...  We present direct subset automata constructions for asynchronous (asynchronous cellular, resp.) automata.  ...  Acknowledgements I wish to thank Volker Diekert and Paul Gastin for interesting discussions and Wolfgang Thomas for pointing out the work of J.-P. Pecuchet.  ... 
doi:10.1016/s0304-3975(96)00117-x fatcat:74ywotnkjffs3fyybgocud4dda

Page 5542 of Mathematical Reviews Vol. , Issue 95i [page]

1995 Mathematical Reviews  
celluluar automaton, but there are infinitely many minimal (i.e., unreducible) nonisomorphic asynchronous cellular automata accepting 7.  ...  {For the entire collection see MR 95b:68004. 95i:68046 68Q10 03D05 68Q80 Pighizzini, Giovanni (I-MILAN-I; Milan) Asynchronous automata versus asynchronous cellular automata.  ... 

Page 5388 of Mathematical Reviews Vol. , Issue 94i [page]

1994 Mathematical Reviews  
{For the entire collection see MR 94i:68007.} 94i:68211 68Q80 Gastin, Paul (F-PARIS6-BP; Paris); Petit, Antoine (F-PARIS11-RI; Orsay) Asynchronous cellular automata for infinite traces.  ...  Summary: “The notion of infinite traces has been proposed to generalize both the finite traces defined by Mazurkiewicz and the infinite words.  ... 

Reversible Computation in Asynchronous Cellular Automata [chapter]

Jia Lee, Ferdinand Peper, Susumu Adachi, Kenichi Morita, Shinro Mashiko
2002 Lecture Notes in Computer Science  
Particularly suitable asynchronous models for the study of reversibility are asynchronous cellular automata.  ...  In this paper, we present the embedding of a universal reversible Turing machine (RTM) in a two-dimensional self-timed cellular automaton (STCA), a special type of asynchronous cellular automaton, of which  ...  Katsunobu Imai at Hiroshima University for their useful discussions. We also thank the anonymous referees for their valuable comments.  ... 
doi:10.1007/3-540-45833-6_19 fatcat:5zon3kxw4fcxplzc5sgggnj2ky

Page 3638 of Mathematical Reviews Vol. , Issue 95f [page]

1995 Mathematical Reviews  
This paper shows the equivalence between the family of recog- nizable languages over infinite traces and the family of languages which are recognized by deterministic asynchronous cellular Muller automata  ...  Wiestaw Zielonka (F-BORD; Talence) 95f:68169 68Q70 68Q45 Diekert, Volker (D-STGT-I; Stuttgart); Muscholl, Anca (D-STGT-I; Stuttgart) Deterministic asynchronous automata for infinite traces.  ... 

Toward a Structure Theory of Regular Infinitary Trace Languages [chapter]

Namit Chaturvedi
2014 Lecture Notes in Computer Science  
We introduce the model of "synchronization-aware asynchronous automata", which allows us to initiate a classification of regular infinitary trace languages in a form that is in nice correspondence to the  ...  In this paper, we analyze the situation of regular languages of infinite Mazurkiewicz traces that model non-terminating, concurrent behaviors of distributed systems.  ...  Acknowledgement I am grateful to Wolfgang Thomas for encouragement and numerous suggestions for improving this paper, to Marcus Gelderie and Christof Löding for many fruitful discussions.  ... 
doi:10.1007/978-3-662-43951-7_12 fatcat:rpjxwqz3wba6pig2nscfehefnm

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

1997 Mathematical Reviews  
Nondeterministic asynchronous cellular automata with a Biichi acceptance condition can be used to characterize the family of recognizable languages of infinite traces.  ...  This paper is concerned with determinizing asynchronous cellular automata by a direct subset construction and a complementation procedure for non- deterministic asynchronous cellular Biichi automata.  ... 

Page 2584 of Mathematical Reviews Vol. , Issue 97D [page]

1997 Mathematical Reviews  
We use the subset automaton construction in order to extend Klarlund’s progress measure technique of complementation to nondetermin- istic asynchronous cellular Biichi automata for infinite traces.  ...  This provides an answer to the prob- lem of direct determinization for asynchronous cellular automata for finite traces, which has been open for several years.  ... 

Determinizing Asynchronous Automata on Infinite Inputs

Nils Klarlund, Madhavan Mukund, Milind Sohoni
1995 BRICS Report Series  
<br />To handle infinite traces, Gastin and Petit introduced Buchi asynchronous<br />automata, which accept precisely the class of omega-regular trace<br />languages.  ...  Asynchronous automata are a natural distributed machine model<br />for recognizing trace languages - languages defined over an alphabet<br />equipped with an independence relation.  ...  In related work, Muscholl [Mus] has described a complementation construction for Büchi asynchronous cellular automata, which are an alternative distributed model for recognizing trace languages [Zie2  ... 
doi:10.7146/brics.v2i58.19959 fatcat:otfewrye5ra3da5eraiioqiome

Models for quantitative distributed systems and multi-valued logics

Martin Huschenbett
2013 International Journal of Computer Mathematics  
We prove that weighted asynchronous cellular automata and weighted finite automata which satisfy an I-diamond property are equally expressive.  ...  We investigate weighted asynchronous cellular automata with weights in valuation monoids. These automata form a distributed extension of weighted finite automata and allow us to model concurrency.  ...  Asynchronous cellular automata Asynchronous cellular automata [32] are a distributed extension of classical finite automata.  ... 
doi:10.1080/00207160.2012.702211 fatcat:xzrxiclfcngtpiu6g5u7ltf43q

Models for Quantitative Distributed Systems and Multi-Valued Logics [chapter]

Martin Huschenbett
2011 Lecture Notes in Computer Science  
We prove that weighted asynchronous cellular automata and weighted finite automata which satisfy an I-diamond property are equally expressive.  ...  We investigate weighted asynchronous cellular automata with weights in valuation monoids. These automata form a distributed extension of weighted finite automata and allow us to model concurrency.  ...  Asynchronous cellular automata Asynchronous cellular automata [32] are a distributed extension of classical finite automata.  ... 
doi:10.1007/978-3-642-21254-3_24 fatcat:3byda34s3zbyfayvegpoj6s6ee

Page 576 of Mathematical Reviews Vol. , Issue 2003A [page]

2003 Mathematical Reviews  
bound on the products of particle interactions in cellular automata.  ...  For one of the simplest classes of such systems, one-dimensional cellular automata, we establish a rigorous upper bound on the number of distinct products that these interactions can generate.  ... 

Automata and Logics for Concurrent Systems: Five Models in Five Pages [chapter]

Benedikt Bollig
2015 Lecture Notes in Computer Science  
We survey various automata models of concurrent systems and their connection with monadic second-order logic: finite automata, class memory automata, nested-word automata, asynchronous automata, and message-passing  ...  automata.  ...  An example of a trace, where m = 2 and A = {a, b, c}, is depicted in Figure 3 . When running on traces, σ t -automata are actually asynchronous automata or asynchronous cellular automata [23] .  ... 
doi:10.1007/978-3-319-22360-5_1 fatcat:32kv7ksvqjc55eo54t7rfmxp5i

Page 1073 of Mathematical Reviews Vol. , Issue 95b [page]

1995 Mathematical Reviews  
of asynchronous automata is not straightforward.  ...  The cellular automata reversibility problem is to determine, given the specification of a cellular automaton (CA), whether the inverse of the global transition function exists.  ... 
« Previous Showing results 1 — 15 out of 440 results