An introduction to sequential dynamical systems

An Introduction to Sequential Dynamical Systems

Volumn , Issue , 2008, Pages 1-252

  Mortveit, Henning S ^a   Reidys, Christian M ^b  

^a VIRGINIA BIOINFORMATICS INSTITUTE   (United States)

^b NANKAI UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84892261088     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/978-0-387-49879-9     Document Type: Book

References (154)

1. David R. Jefferson. Virtual time. ACM Transactions on Programming Languages and Systems, 7(3):404-425, July 1985.
2. J. Misra. Distributed discrete-event simulation. ACM Computing Surveys, 18(1):39-65, March 1986.
3. nsweeps on unstructured meshes. Nuclear Science and Engineering, 140:111-136, 2002.
4. K. Nagel, M. Rickert, and C. L. Barrett. Large-scale traffic simulation. Lecture Notes in Computer Science, 1215:380-402, 1997.
5. M. Rickert, K. Nagel, M. Schreckenberg, and A. Latour. Two lane traffic simulations using cellular automata. Physica A, 231:534-550, October 1996.
6. K. Nagel, M. Schreckenberg, A. Schadschneider, and N. Ito. Discrete stochastic models for traffic flow. Physical Review E, 51:2939-2949, April 1995.
7. K. Nagel and M. Schreckenberg. A cellular automaton model for freeway traffic. Journal de Physique I, 2:2221-2229, 1992.
8. Kai Nagel and Peter Wagner. Traffic Flow: Approaches to Modelling and Control. John Wiley & Sons, New York, 2006.
9. Randall J. LeVeque. Numerical Methods for Conservation Laws, 2nd ed. Birkhauser, Boston, 1994.
10. Tommaso Toffoli. Cellular automata as an alternative to (rather than an approximation of) differential equations in modeling physics. Physica D, 10:117-127, 1984.
11. Justin L. Tripp, Anders Å. Hansson, Maya Gokhale, and Henning S. Mortveit. Partitioning hardware and software for reconfigurable supercomputing applications: A case study. In Proceedings of the 2005 ACM/IEEE Conference on Supercomputing (SC|05), September 2005. Accepted for inclusion in proceedings.
12. Eric Weisstein. Mathworld. http://mathworld.wolfram.com, 2005.
13. Anthony Ralston and Philip Rabinowitz. A First Course in Numerical Analysis, 2nd ed. Dover Publications, 2001.
14. C. L. Barrett, H. B. Hunt III, M. V. Marathe, S. S. Ravi, D. J. Rosenkrantz, and R. E. Stearns. On some special classes of sequential dynamical systems. Annals of Combinatorics, 7:381-408, 2003.
15. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, San Francisco, 1979.
16. C. L. Barrett, H. H. Hunt, M. V. Marathe, S. S. Ravi, D. Rosenkrantz, and R. Stearns. Predecessor and permutation existence problems for sequential dynamical systems. In Proc. of the Conference on Discrete Mathematics and Theoretical Co mp uter Science, pages 69-80, 2003.
17. K. Sutner. On the computational complexity of finite cellular automata. Journal of Computer and System Sciences, 50(1):87-97, 1995.
18. Jarkko Kari. Theory of cellular automata: A survey. Theoretical Computer Science, 334:3-33, 2005.
19. Jarkko Kari. Reversibility of 2D CA. Physica D, 45-46:379-385, 1990.
20. C. L. Barrett, H. H. Hunt, M. V. Marathe, S. S. Ravi, D. Rosenkrantz, R. Stearns, and P. Tosic. Gardens of Eden and fixed point in sequential dynamical systems. In Discrete Models: Combinatorics, Computation and Geometry, pages 95-110, 2001. Available via LORIA, Nancy, France. http://www.dmtcs.org/dmtcs- ojs/index.php/proceedings/article/view/dmAA0106/839.
21. Richard P. Stanley. Enumerative Combinatorics: Volume 1. Cambridge University Press, New York, 2000.
22. Kunihiko Kaneko. Pattern dynamics in spatiotemporal chaos. Physica D, 34:1-41, 1989.
23. York Dobyns and Harald Atmanspacher. Characterizing spontaneous irregular behavior in coupled map lattices. Chaos, Solitions and Fractals, 24:313-327, 2005.
24. Chai Wah Wu. Synchronization in networks of nonlinear dynamical systems coupled via a directed graph. Nonlinearity, 18:1057-1064, 2005.
25. Thomas M. Liggett. Interacting Particle Systems. Classics in Mathematics. Springer, New York, 2004.
26. Wolfgang Reisig and Grzegorz Rozenberg. Lectures on Petri Nets I: Basic Models: Advances in Petri Nets. Number 1491 in Lecture Notes in Computer Science. Springer-Verlag, New York, 1998.
27. John von Neumann. Theory of Self-Reproducing Automata. University of Illinois Press, Chicago, 1966. Edited and completed by Arthur W. Burks.
28. E. F. Codd. Cellular Automata. Academic Press, New York, 1968.
29. G. A. Hedlund. Endomorphisms and automorphisms of the shift dynamical system. Math. Syst. Theory, 3:320-375, 1969.
30. Erica Jen. Aperiodicity in one-dimensional cellular automata. Physica D, 45:3-18, 1990.
31. Burton H. Voorhees. Computational Analysis of One-Dimensional Cellular Automata, volume 15 of A. World Scientific, Singapore, 1996.
32. O. Martin, A. Odlyzko, and S. Wolfram. Algebraic properties of cellular automata. Commun. Math. Phys., 93:219-258, 1984.
33. René A. Hernández Toledo. Linear finite dynamical systems. Communcations in Algebra, 33:2977-2989, 2005.
34. Mats G. Nordahl. Discrete Dynamical Systems. PhD thesis, Institute of Theoretical Physics, Göteborg, Sweden, 1988.
35. Kristian Lindgren, Christopher Moore, and Mats Nordahl. Complexity of two-dimensional patterns. Journal of Statistical Physics, 91 (5-6):909-951, 1998.
36. Stephen J. Willson. On the ergodic theory of cellular automata. Mathematical Systems Theory, 9(2):132-141, 1975.
37. D. A. Lind. Applications of ergodic theory and sofic systems to cellular automata. Physica D, 10 D: 36-44, 1984.
38. P. A. Ferrari. Ergodicity for a class of probabilistic cellular automata. Rev. Mat. Apl., 12:93-102, 1991.
39. Henryk Fukś. Probabilistic cellular automata with conserved quantities. Nonlinearity, 17:159-173, 2004.
40. Michele Bezzi, Franco Celada, Stefano Ruffo, and Philip E. Seiden. The transition between immune and disease states in a cellular automaton model of clonal immune response. Physica A, 245:145-163, 1997.
41. U. Frish, B. Hasslacher, and Y. Pomeau. Lattice-gas automata for the Navier-Stokes equations. Physical Review Letters, 56:1505-1508, 1986.
42. Dieter A. Wolf-Gladrow. Lattice-Gas Cellular Automata and Lattice Bolzmann Models: An Introduction, volume 1725 of Lecture Notes in Mathematics. Springer-Verlag, New York, 2000.
43. J.-P. Rivet and J. P. Boon. Lattice Gas Hydrodynamics, volume 11 of Cambridge Nonlinear Science Series. Cambridge University Press, New York, 2001.
44. Parimal Pal Chaudhuri. Additive Cellular Automata. Theory and Applications, volume 1. IEEE Computer Society Press, 1997.
45. Palash Sarkar. A brief history of cellular automata. ACM Computing Surveys, 32(1):80-107, 2000.
46. Andrew Ilichinsky. Cellular Automata: A Discrete Universe. World Scientific, Singapore, 2001.
47. Stephen Wolfram. Theory and Applications of Cellular Automata, volume 1 of Advanced Series on Complex Systems. World Scientific, Singapore, 1986.
48. B. Schönfisch and A. de Roos. Synchronous and asynchronous updating in cellular automata. BioSystems, 51:123-143, 1999.
49. Stephen Wolfram. Statistical mechanics of cellular automata. Rev. Mod. Phys., 55:601-644, 1983.
50. Bernard Elspas. The theory of autonomous linear sequential networks. IRE Trans. on Circuit Theory, 6:45-60, March 1959.
51. William Y. C. Chen, Xueliang Li, and Jie Zheng. Matrix method for linear sequential dynamical systems on digraphs. Appl. Math. Comput., 160:197-212, 2005.
52. Ezra Brown and Theresa P. Vaughan. Cycles of directed graphs defined by matrix multiplication (mod n). Discrete Mathematics, 239:109-120, 2001.
53. Wentian Li. Complex Patterns Generated by Next Nearest Neighbors Cellular Automata, pages 177-183. Elsevier, Burlington, MA, 1998.
54. (Reprinted from Comput. & Graphics Vol. 13, No 4, 531-537, 1989.)
55. S. A. Kauffman. Metabolic stability and epigenesis in randomly constructed genetic nets. Journal of Theoretical Biology, 22:437-467, 1969.
56. I. Shmulevich and S. A. Kauffman. Activities and sensitivities in Boolean network models. Physical Review Letters, 93(4):048701:1-4, 2004.
57. E. R. Dougherty and I. Shmulevich. Mappings between probabilistic Boolean networks. Signal Processing, 83(4):799-809, 2003.
58. I. Shmulevich, E. R. Dougherty, and W. Zhang. From Boolean to probabilistic Boolean networks as models of genetic regulatory networks. Proceedings of the IEEE, 90(11):1778-1792, 2002.
59. I. Shmulevich, E. R. Dougherty, S. Kim, and W. Zhang. Probabilistic Boolean networks: A rule-based uncertainty model for gene regulatory networks. Bioinformatics, 18(2):261-274, 2002.
60. Carlos Gershenson. Introduction to random Boolean networks. arXiv:nlin. AO/040806v3-12Aug2004, 2004. (Accessed August 2005.)
61. Mihaela T. Matache and Jack Heidel. Asynchronous random Boolean network model based on elementary cellular automata rule 126. Physical Review E, 71:026231:1-13, 2005.
62. Michael Sipser. Introduction to the Theory of Computation. PWS Publishing Company, Boston, 1997.
63. John E. Hopcroft and Jeffrey D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, MA, 1979.
64. Mohamed G. Gouda. Elements of Network Protocol Design. Wiley-Interscience, New York, 1998.
65. J. K. Park, K. Steiglitz, and W. P. Thruston. Soliton-like behavior in automata. Physica D, 19 D: 423-432, 1986.
66. N. Bourbaki. Groupes et Algebres de Lie. Hermann, Paris, 1968.
67. J. P. Serre. Trees. Springer-Verlag, New York, 1980.
68. Sheldon Axler. Linear Algebra Done Right, 2nd ed. Springer-Verlag, New York, 1997.
69. P. Cartier and D. Foata. Problemes combinatoires de commutation et reárrangements, volume 85 of Lecture Notes in Mathematics. Springer-Verlag, New York, 1969.
70. Volker Diekert. Combinatorics on Traces, volume 454 of Lecture Notes in Computer Science. Springer-Verlag, New York, 1990.
71. Richard P. Stanley. Acyclic orientations of graphs. Discrete Math., 5:171-178, 1973.
72. Morris W. Hirsch and Stephen Smale. Differential Equations, Dynamical Systems, and Linear Algebra. Academic Press, New York, 1974.
73. Lawrence Perko. Differential Equations and Dynamical Systems. Springer-Verlag, New York, 1991.
74. Erwin Kreyszig. Introductory Functional Analysis with Applications. John Wiley and Sons, New York, 1989.
75. Michael Benedicks and Lennart Carleson. The dynamics of the Hénon map. Annals of Mathematics, 133:73-169, 1991.
76. John B. Fraleigh. A First Course in Abstract Algebra, 7th ed. Addison-Wesley, Reading, MA, 2002.
77. P. B. Bhattacharya, S. K. Jain, and S. R. Nagpaul. Basic Abstract Algebra, 2nd ed. Cambridge University Press, New York, 1994.
78. Nathan Jacobson. Basic Algebra I, 2nd ed. W. H. Freeman and Company, San Francisco, 1995.
79. Thomas W. Hungerford. Algebra, volume 73 of GTM. Springer-Verlag, New York, 1974.
80. B. L. van der Waerden. Algebra Volume I. Springer-Verlag, New York, 1971.
81. B. L. van der Waerden. Algebra Volume II. Springer-Verlag, New York, 1971.
82. Warren Dicks. Groups Trees and Projective Modules. Springer-Verlag, New York, 1980.
83. Reinhard Diestel. Graph Theory, 2nd ed. Springer-Verlag, New York, 2000.
84. Chris Godsil and Gordon Royle. Algebraic Graph Theory. Number 207 in GTM. Springer-Verlag, New York, 2001.
85. John Riordan. Introduction to Combinatorial Analysis. Dover Publications, Mineola, NY, 2002.
86. J. H. van Lint and R. M. Wilson. A Course in Combinatorics. Cambridge University Press, New York, 1992.
87. John Guckenheimer and Philip Holmes. Nonlinear Oscillations, Dynamical Systems, and Bifurcations of Vector Fields. Springer-Verlag, New York, 1983.
88. Earl A. Coddington and Norman Levinson. Theory of Ordinary Differential Equations. McGraw-Hill, New York, 1984.
89. Robert L. Devaney. An Introduction to Chaotic Dynamical Systems, 2nd ed. Reading, MA, Addison-Wesley, 1989.
90. Welington de Melo and Sebastian van Strien. One-Dimensional Dynamics. Springer-Verlag, Berlin, 1993.
91. Reinhard Laubenbacher and Bodo Paraigis. Equivalence relations on finite dynamical systems. Adv. Appl. Math., 26:237-251, 2001.
92. J. S. Milne. Étale Cohomology. Princeton University Press, Princeton, NJ, 1980.
93. Reinhard Laubenbacher and Bodo Pareigis. Update schedules of sequential dynamical systems. Discrete Applied Mathematics, 154(6):980-994, 2006.
94. C. M. Reidys. The phase space of sequential dynamical systems. Annals of Combinatorics. Submitted in 2006.
95. C. L. Barrett, H. S. Mortveit, and C. M. Reidys. Elements of a theory of simulation II: Sequential dynamical systems. Appl. Math. Comput., 107 (2-3):121-136, 2000.
96. Saunders MacLane. Category Theory for the Working Mathematician, 2nd ed. Number 5 in GTM. Springer-Verlag, 1998.
97. N. Kahale and L. J. Schulman. Bounds on the chromatic polynomial and the number of acyclic orientations of a graph. Combinatorica, 16:383-397, 1996.
98. N. Linial. Legal colorings of graphs. Proc. 24th Symp. on Foundations of Computer Science, 24:470-472, 1983.
99. U. Manber and M. Tompa. The effect of number of Hamiltonian paths on the complexity of a vertex-coloring problem. SIAM J. Comp., 13:109-115, 1984.
100. R. Graham, F. Yao, and A. Yao. Information bounds are weak in the shortest distance problem. J. ACM, 27:428-444, 1980.
101. C. L. Barrett, H. S. Mortveit, and C. M. Reidys. Elements of a theory of simulation IV: Fixed points, invertibility and equivalence. Appl. Math. Comput., 134:153-172, 2003.
102. C. M. Reidys. On certain morphisms of sequential dynamical systems. Discrete Mathematics, 296 (2-3):245-257, 2005.
103. Reinhard Laubenbacher and Bodo Pareigis. Decomposition and simulation of sequential dynamical systems. Adv. Appl. Math., 30:655-678, 2003.
104. William S. Massey. Algebraic Topology: An Introduction, volume 56 of GTM. Springer-Verlag, New York, 1990.
105. William S. Massey. A Basic Course in Algebraic Topology, volume 127 of GTM. Springer-Verlag, New York, 1997.
106. Warren Dicks and M. J. Dunwoody. Groups Acting on Graphs. Cambridge University Press, New York, 1989.
107. F. T. Leighton. Finite common coverings of graphs. Journal of Combinatorial Theory, 33:231-238, 1982.
108. Béla Bollobás. Graph Theory. An Introductory Course, volume 63 of GTM. Springer-Verlag, New York, 1979.
109. J. H. van Lint. Introduction to Coding Theory, 3rd ed. Number 86 in GTM. Springer-Verlag, New York, 1998.
110. C. L. Barrett, H. S. Mortveit, and C. M. Reidys. Elements of a theory of simulation III, equivalence of SDS. Appl. Math. Comput., 122:325-340, 2001.
111. Erica Jen. Cylindrical cellular automata. Comm. Math. Phys., 118:569-590, 1988.
112. V. S. Anil Kumar, Matthew Macauley, and Henning S. Mortveit. Update order instability in graph dynamical systems. Preprint, 2006.
113. C. M. Reidys. On acyclic orientations and sequential dynamical systems. Adv. Appl. Math., 27:790-804, 2001.
114. A. Å. Hansson, H. S. Mortveit, and C. M. Reidys. On asynchronous cellular automata. Advances in Complex Systems, 8(4):521-538, December 2005.
115. The GAP Group. Gap - groups, algorithms, programming - a system for computational discrete algebra. http://www.gap-system.org, 2005.
116. G. A. Miller. Determination of all the groups of order 96. Ann. of Math., 31:163-168, 1930.
117. Reinhard Laue. Zur konstruktion und klassifikation endlicher auflösbarer gruppen. Bayreuth. Math. Schr., 9, 1982.
118. H. S. Mortveit. Sequential Dynamical Systems. PhD thesis, NTNU, 2000.
119. C. M. Reidys. Sequential dynamical systems over words. Annals of Combinatorics, 10, 2006.
120. C. M. Reidys. Combinatorics of sequential dynamical systems. Discrete Mathematics. In press.
121. Luis David Garcia, Abdul Salam Jarrah, and Reinhard Laubenbacher. Sequential dynamical systems over words. Appl. Math. Comput., 174(1):500-510, 2006.
122. A. M. Law and W. D. Kelton. Simulation Modeling and Analysis. McGraw-Hill, Singapore, 1991.
123. Christian P. Robert and George Casella. Monte Carlo Statistical Methods, 2nd ed. Springer Texts in Statistics. Springer-Verlag, New York, 2005.
124. G. Korniss, M. A. Novotny, H. Guclu, Z. Toroczkai, and P. A. Rikvold. Suppressing roughness of virtual times in parallel discrete-event simulations. Science, 299:677-679, January 2003.
125. P.-Y. Louis. Increasing coupling of probabilistic cellular automata. Statist. Probab. Lett., 74(1):1-13, 2005.
126. D. A. Dawson. Synchronous and asynchronous reversible markov systems. Canad. Math. Bull., 17(5):633-649, 1974.
127. L. N. Vasershtein. Markov processes over denumerable products of spaces describing large system of automata. Problemy Peredachi Informatsii, 5(3):64-72, 1969.
128. Walter Fontana, Peter F. Stadler, Erich G. Bornberg-Bauer, Thomas Griesmacher, Ivo L. Hofacker, Manfred Tacker, Pedro Tarazona, Edward D. Weinberger, and Peter K. Schuster. RNA folding and combinatory landscapes. Phys. Rev. E, 47:2083-2099, 1993.
129. W. Fontana and P. K. Schuster. Continuity in evolution: On the nature of transitions. Science, 280:1451-1455, 1998.
130. W. Fontana and P. K. Schuster. Shaping space: The possible and the attainable in RNA genotype-phenotype mapping. J. Theor. Biol., 1998.
131. Christoph Flamm, Ivo L. Hofacker, and Peter F. Stadler. RNA in silico: The computational biology of RNA secondary structures. Advances in Complex Systems, 2(1):65-90, 1999.
132. C. M. Reidys, C. V. Forst, and P. Schuster. Replication and mutation on neutral networks. Bulletin of Mathematical Biology, 63(1):57-94, 2001.
133. C. M. Reidys, P. F. Stadler, and P. Schuster. Generic properties of combinatory maps: Neutral networks of RNA secondary structures. Bull. Math. Biol., 59:339-397, 1997.
134. W. R. Schmitt and M. S. Waterman. Plane trees and RNA secondary structure. Discr. Appl. Math., 51:317-323, 1994.
135. J. A. Howell, T. F. Smith, and M. S. Waterman. Computation of generating functions for biological molecules. SIAM J. Appl. Math., 39:119-133, 1980.
136. M. S. Waterman. Combinatorics of RNA hairpins and cloverleaves. Studies in Appl. Math., 60:91-96, 1978.
137. C. Tuerk and L. Gold. Systematic evolution of ligands by exponential enrichment: RNA ligands to bacteriophage T4 DNA polymerase. Science, 249:505-510, 1990.
138. M. Kimura. The Neutral Theory of Molecular Evolution. Cambridge University Press, Cambridge, 1983.
139. C. V. Forst, C. M. Reidys, and J. Weber. Lecture Notes in Artificial Intelligence V 929, pages 128-147. Springer-Verlag, New York, 1995. Evolutionary Dynamics and Optimization: Neutral Networks as Model Landscapes for RNA Secondary Structure Landscapes.
140. M. Eigen, J. S. McCaskill, and P. K. Schuster. The molecular quasi-species. Adv. Chem. Phys., 75:149-263, 1989.
141. M. Huynen, P. F. Stadler, and W. Fontana. Smoothness within ruggedness: The role of neutrality in adaptation. PNAS, 93:397-401, 1996.
142. I. L. Hofacker, P. K. Schuster, and P. F. Stadler. Combinatorics of RNA secondary structures. Discrete Applied Mathematics, 88:207-237, 1998.
143. C. M. Reidys and P. F. Stadler. Bio-molecular shapes and algebraic structures. Computers and Chemistry, 20(1):85-94, 1996.
144. U. Göbel, C. V. Forst, and P. K. Schuster. Structural constraints and neutrality in RNA. In R. Hofestädt, editor, LNCS/LNAI Proceedings of GCB96, Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1997.
145. H. S. Mortveit and C. M. Reidys. Neutral evolution and mutation rates of sequential dynamical systems over words. Advances in Complex Systems, 7 (3-4):395-418, 2004.
146. André Thayse. Boolean Calculus of Differences, volume 101 of Lecture Notes in Computer Science. Springer-Verlag, New York, 1981.
147. Gérard Y. Vichniac. Boolean derivatives on cellular automata. Physica D, 45:63-74, 1990.
148. Fülöp Bazsó. Derivation of vector-valued Boolean functions. Acta Mathematica Hungarica, 87(3):197-203, 2000.
149. Fülöp Bazsó and Elemér Lábos. Boolean-Lie algebras and the Leibniz rule. Journal of Physics A: Mathematical and General, 39:6871-6876, 2006.
150. Kunihiko Kaneko. Spatiotemporal intermittency in couple map lattices. Progress of Th eo reti cal Physi cs, 74(5):1033-1044, November 1985.
151. M. Golubitsky, M. Pivato, and I. Stewart. Interior symmetry and local bifurcations in coupled cell networks. Dynamical Systems, 19(4):389-407, 2004.
152. S. Eidenbenz, A. Å. Hansson, V. Ramaswamy, and C. M. Reidys. On a new class of load balancing network protocols. Advances in Complex Systems, 10(3), 2007.
153. A. Å. Hansson and C. M. Reidys. A discrete dynamical systems framework for packet-flow on networks. FMJS, 22(1):43-67, 2006.
154. A. Å. Hansson and C. M. Reidys. Adaptive routing and sequential dynamical systems. Private communication.