2,865 Hits in 2.4 sec

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 6653 of Mathematical Reviews Vol. , Issue 90K [page]

1990 Mathematical Reviews  
He proves that realization by asynchronous automata is possible only for finite automata with memory depth equal to | which can be described by the functions y(t) = f(x(t), y(t—1)), y(t) = f(x(t), x(t-  ...  This paper deals with the structure of the “dot-depth hierarchyof regular star-free languages.  ... 

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

2000 Mathematical Reviews  
Summary: “Asynchronous cellular automata and asynchronous automata were introduced by W. Zielonka [RAIRO Inform. Théor.  ...  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.”  ... 

Page 250 of Mathematical Reviews Vol. 55, Issue 1 [page]

1978 Mathematical Reviews  
From the authors’ summary: “The structural properties of exten- sions of asynchronous automata and some of their generalizations, namely, k-asynchronous, k*-asynchronous and (k*, /)-asynchro- nous automata  ...  Hierarchies of aperiodic languages. 1833 | English summary) | Rev. Frangaise Automat. Informat. Recherche Opérationnelle Sér. | Rouge Informat. Théor. 10 (1976), no.  ... 

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

1994 Mathematical Reviews  
The first family of characterizations concerns the safety-progress classification, which describes a hierarchy within the set of temporal properties.  ...  This leads to an algebra of fifo-nets, together with different congruences, which extends to the asynchronous communication part of the work on CCS, TCSP and ACP.”  ... 

Page 3362 of Mathematical Reviews Vol. , Issue 91F [page]

1991 Mathematical Reviews  
In this paper the author introduces a special kind of automata: asynchronous cellular automata which accept exactly recognizable trace languages [Cori et al., op. cit.].  ...  Cori, the reviewer and the author, “Asynchronous mappings and asynchronous cellular automata”, Rep. 8997, Univ. Bordeaux I, Talence, 1989; per revr.; D.  ... 

Page 1665 of Mathematical Reviews Vol. , Issue 83d [page]

1983 Mathematical Reviews  
Furthermore, the relative profitability of automata is defined and by comparing the profitability of the newly constructed automata, it is found that the class of adaptive automata has an infinite hierarchy  ...  A description of the mechanism of renewal of an asynchronic process is formalized. An operation of reduction of asynchronic processes is proposed.  ... 

Distributed Automata and Logic [article]

Fabian Reiter
2018 arXiv   pre-print
Our second class transfers the standard notion of asynchronous algorithm to the setting of nonlocal distributed automata.  ...  Exploiting the connection with logic, we additionally prove that the expressive power of those asynchronous automata is independent of whether or not messages can be lost.  ...  Hierarchy of the classes of pointed-digraph languages recognizable by distributed automata ( ), depending on whether the automata are synchronous (neither "la" nor "a"), lossless-asynchronous ("la"), asynchronous  ... 
arXiv:1805.06238v1 fatcat:6cdcn5fkszae5c4qeqs5elhdga

A Note on Pushdown Automata Systems [chapter]

Holger Petersen
2014 Lecture Notes in Computer Science  
Another line of research modified the definition of PCPA such that communication is asynchronous (Otto 2013).  ...  We show that UPDAS accepting with empty stack do not form a hierarchy depending on the number of components and that the membership problem is complete in NP, answering two open problems from (Arroyo et  ...  Theorem 2 There is no hierarchy of languages accepted by UDPAS depending on the number of components. Proof.  ... 
doi:10.1007/978-3-319-09704-6_30 fatcat:5x4ga4hkbjgu3prl3gyzutdwua

A Toolset for Modelling and Verification of GALS Systems [chapter]

S. Ramesh, Sampada Sonalkar, Vijay D'silva, Naveen Chandra R., B. Vijayalakshmi
2004 Lecture Notes in Computer Science  
Tools such as SAL/PVS, Polis, Reactive Modules, and SMV capture both models of concurrency but significant semantic differences exist such as notions of acceptable programs and pre-emption mechanisms.  ...  Conclusion We have presented a tool set for modelling and verification of GALS applications.  ...  The state AwaitDSP in ARM has hierarchy and contains two automata.  ... 
doi:10.1007/978-3-540-27813-9_47 fatcat:poimdmxdnba37hck6p35pdwowi

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.  ...  Of course, for every Lr A*, it holds LElin( CL&). It is possible to introduce Chomsky-like hierarchies of trace languages [l] .  ...  automata and of minimal asynchronous cellular automata.  ... 
doi:10.1016/0304-3975(94)90232-1 fatcat:xjmvv3zhavh6xi4me4o3jrg6ku

R70-17 Asynchronous Sequential Circuits with Feedback

A.D. Friedman
1970 IEEE transactions on computers  
This paper attempts to extend some of these results to realize asynchronous machines in a similar manner.  ...  In the design of synchronous sequential machines, various canonical realizations which make use of feedback shift registers have been developed [1], [2].  ...  Thus, a hierarchy of languages is established, based on the dimension of the iterative arrays which -accept them.  ... 
doi:10.1109/t-c.1970.223004 fatcat:7myfylgqm5fwjgfzuami7sdjte

Page 6454 of Mathematical Reviews Vol. , Issue 2004h [page]

2004 Mathematical Reviews  
Summary: “This paper presents a method for the automatic syn- thesis of asynchronous circuits from Petri net specifications.  ...  Both the encoding technique and the set of transforma- tions preserve the property of free-choiceness, thus enabling the use of structural methods for the synthesis of asynchronous cir- cuits.  ... 

Page 1004 of Mathematical Reviews Vol. 56, Issue 3 [page]

1978 Mathematical Reviews  
It is shown that the language L can be used for problems of analysis and synthesis of automata.” 7327 Mikhailov, G. I. [Mihailov, G. I.] 7328 Sets and automata having a finite memory.  ...  “In the last section we give some applications of our results to the behavior of initial asynchronous sequential machines”. Cristian Calude (Bucharest) Wood, D.  ... 

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

1995 Mathematical Reviews  
Petersburg) Hierarchy of fuzzy cellular automata. (English summary) Fuzzy Sets and Systems 62 (1994), no. 2, 167-174.  ...  Summary: “We develop the notion of cellular automata in the di- rections of synchroneity/asynchroneity and stationarity/non- stationarity, and fuzzify the principal features of cellular automata such as  ... 
« Previous Showing results 1 — 15 out of 2,865 results