(A-)Synchronous (Non-)Deterministic Cell Spaces Simulating Each Other

Abstract Asynchronous cell spaces are capable of simulating the behavior of (non-)deterministic synchronous spaces in the sense that the same sequence (tree) of infinite configurations is produced. In the class of asynchronous spaces, deterministic local rules are sufficient to produce any nondeterministic global behavior.

[1]  Takeo Yaku.  Surjectivity of Nondeterministic Parallel Maps Induced by Nondeterministic Cellular Automata , 1976, J. Comput. Syst. Sci..

[2]  Alvy Ray Smith,et al.  Real-Time Language Recognition by One-Dimensional Cellular Automata , 1972, J. Comput. Syst. Sci..

[3]  D. Richardson,et al.  Continuous Self-Reproduction , 1976, J. Comput. Syst. Sci..

[4]  Roland Vollmar.  On two modified problems of synchronization in cellular automata , 1977, Acta Cybern..

[5]  Bernard P. Zeigler,et al.  Toward a Formal Theory of Modeling and Simulation: Structure Preserving Morphisms , 1972, JACM.

[6]  Antonio Grasselli,et al.  Synchronization of Cellular Arrays: The Firing Squad Problem in Two Dimensions , 1975, Inf. Control..

[7]  Victor Aladyev,et al.  Survey of research in the theory of homogeneous structures and their applications , 1974 .

[8]  Amir Pnueli,et al.  Marked Directed Graphs , 1971, J. Comput. Syst. Sci..

[9]  Richard J. Lipton,et al.  Synchronization and computing capabilities of linear asynchronous structures , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[10]  Suhas S. Patil,et al.  COORDINATION OF ASYNCHRONOUS EVENTS , 1970 .

[11]  M. Hack,et al.  PETRI NET LANGUAGE , 1976 .

[12]  Ilka Shinahr.  Two- and Three-Dimensional Firing-Squad Synchronization Problems , 1974, Inf. Control..

[13]  Shoichi Noguchi,et al.  Fault Tolerant Cellular Automata , 1975, J. Comput. Syst. Sci..

[14]  Serafino Amoroso,et al.  Indecomposable Parallel Maps in Tessellation Structures , 1976, J. Comput. Syst. Sci..

[15]  C. Petri.  Kommunikation mit Automaten , 1962 .

[16]  Serafino Amoroso,et al.  Structural and Behavioral Equivalences of Tessellation Automata , 1971, Inf. Control..

[17]  Adrian Walker,et al.  Synchronization of Growing Cellular Arrays , 1974, Inf. Control..

[18]  Serafino Amoroso,et al.  Some Clarifications of the Concept of a Garden-of-Eden Configuration , 1975, J. Comput. Syst. Sci..

[19]  Francesco Romani.  Cellular automata synchronization , 1976 .

[20]  E. F. Codd,et al.  Cellular automata , 1968 .

[21]  Richard M. Karp,et al.  Parallel Program Schemata , 1969, J. Comput. Syst. Sci..

[22]  F. R. Moore,et al.  A Generalized Firing Squad Problem , 1968, Inf. Control..

[23]  Hidenosuke Nishio,et al.  Fault Tolerant Cellular Spaces , 1975, J. Comput. Syst. Sci..

[24]  Michel Hack,et al.  ANALYSIS OF PRODUCTION SCHEMATA BY PETRI NETS , 1972 .

[25]  P. Rosenstiehl,et al.  INTELLIGENT GRAPHS: NETWORKS OF FINITE AUTOMATA CAPABLE OF SOLVING GRAPH PROBLEMS , 1972 .

[26]  Joseph R. Shoenfield,et al.  Mathematical logic , 1967 .

[27]  R. Karp,et al.  Properties of a model for parallel computations: determinacy , 1966 .

[28]  Kojiro Kobayashi,et al.  The Firing Squad Synchronization Problem for Two-Dimensional Arrays , 1977, Inf. Control..

[29]  E. R. Banks.  INFORMATION PROCESSING AND TRANSMISSION IN CELLULAR AUTOMATA , 1971 .

[30]  Abraham Waksman,et al.  An Optimum Solution to the Firing Squad Synchronization Problem , 1966, Inf. Control..

[31]  D. Richardson,et al.  Tessellations with Local Transformations , 1972, J. Comput. Syst. Sci..

[32]  Alvy Ray Smith,et al.  Cellular Automata Complexity Trade-Offs , 1971, Inf. Control..

[33]  Stephen N. Cole.  Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines , 1969, IEEE Trans. Computers.

[34]  John von Neumann,et al.  Theory Of Self Reproducing Automata , 1967 .

[35]  Takeo Yaku,et al.  The Constructibility of a Configuration in a Cellular automaton , 1973, J. Comput. Syst. Sci..

[36]  LUTZ PRIESE,et al.  A Note on Asynchronous Cellular Automata , 1978, J. Comput. Syst. Sci..

[37]  Serafino Amoroso,et al.  Decision Procedures for Surjectivity and Injectivity of Parallel Maps for Tessellation Structures , 1972, J. Comput. Syst. Sci..

[38]  Robert M. Keller,et al.  A Fundamental Tehoerem of Asynchronous Parallel Computation , 1974, Sagamore Computer Conference.

[39]  E. F. Moore.  The firing squad synchronization problem , 1964 .