Errata for the paper "Predecessor existence problems for finite discrete dynamical systems" [Theoret. Comput. Sci. 386 (1-2) (2007) 3-37] (DOI:10.1016/j.tcs.2007.04.026);Predecessor existence problems for finite discrete dynamical systems

Theoretical Computer Science

Volumn 386, Issue 1-2, 2007, Pages 3-37

  Barrett, Chris ^a,b   Hunt III, Harry B ^c   Marathe, Madhav V ^a,b   Ravi, S S ^c   Rosenkrantz, Daniel J ^c   Stearns, Richard E ^c   Thakur, Mayur ^d  

^a VIRGINIA BIOINFORMATICS INSTITUTE   (United States)

^b State University   (United States)

^c State University of New York   (United States)

^d Architectural and Environmental Engineering   (United States)

Author keywords

Cellular automata; Computational complexity; Data flow analysis; Discrete dynamical systems; Predecessor existence; Software and hardware verification

Indexed keywords

CELLULAR AUTOMATA; COMPUTATIONAL COMPLEXITY; CONCURRENT ENGINEERING; DATA FLOW ANALYSIS; DYNAMIC PROGRAMMING; HOPFIELD NEURAL NETWORKS; MATHEMATICAL TRANSFORMATIONS;

DECISION VERSIONS; FINITE DISCRETE DYNAMICAL SYSTEMS; PREDECESSOR EXISTENCE PROBLEMS; SYSTOLIC NETWORKS;

DYNAMICAL SYSTEMS;

EID: 34648828679     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2007.11.001     Document Type: Erratum

References (72)

1. Albert R., and Barabasi A. Statistical mechanics of complex networks. Reviews of Modern Physics 74 1 (2002) 47-97
2. Albert J., and Culik II K. Simple universal cellular automata and its one-way and totalistic version. Complex Systems 1 (1987) 1-16
3. R. Axtell, Why agents? On the Varied Motivations for Agent Computing in the Social Sciences, Center on Social and Economic Dynamics, Working Paper No. 17, Nov. 2000
4. Axtell R. Effects of interaction topology and activation regime in several multi-agent systems. Multi Agent Based Simulation. Lecture Notes in Artificial Intelligence vol. 1979 (2000), Springer-Verlag, New York, NY
5. C. Barrett, H. Hunt III, M. Marathe, S. Ravi, D. Rosenkrantz, R. Stearns, P. Tosic, Gardens of Eden and fixed points in sequential dynamical systems, in: Proc. of the International Conference on Discrete Models - Combinatorics, Computation and Geometry, DM-CCG, Paris, July 2001, pp. 95-110
6. Barrett C., Hunt III H., Marathe M., Ravi S., Rosenkrantz D., and Stearns R. Reachability problems for sequential dynamical systems with threshold functions. Theoretical Computer Science 295 1-3 (2003) 41-64
7. C. Barrett, H. Hunt III, M. Marathe, S. Ravi, D. Rosenkrantz, R. Stearns, Predecessor and permutation existence problems for sequential dynamical systems, in: Proceedings of the International Conference on Discrete Models for Complex Systems, DM-CS 2003, Lyon, France, June 2003, pp. 69-80
8. Barrett C., Mortveit H., and Reidys C. Elements of a theory of computer simulation III: equivalence of SDSs. Applied Mathematics and Computation 122 3 (2001) 325-340
9. H. Bodlaender, Treewidth: Algorithmic techniques and results, in: Proc. 22nd Symposium on Mathematical Foundations of Computer Science, MFCS 1997, Bratislava, Slovak Republic, August 1997, pp. 29-36
10. Creignou N., and Hermann M. Complexity of generalized satisfiability counting problems. Information and Computation 125 1 (1996) 1-12
11. Cheng S., and Kramer J. Tractable dataflow analysis for distributed systems. IEEE Transactions on Software Engineering 20 8 (1994) 579-593
12. Creignou N., Khanna S., and Sudan M. Complexity Classifications of Boolean Constraint Satisfaction Problems. SIAM Monographs on Discrete Mathematics and Applications vol. 7 (2001), SIAM, Philadelphia, PA
13. Culik II K., Pachl J., and Yu S. On the limit sets of cellular automata. SIAM Journal on Computing 18 4 (1989) 831-842
14. Culik II K., and Karhumäki J. On totalistic systolic networks. Information Processing Letters 26 5 (1988) 231-236
15. M. D'Antonio, G. Delzanno, SAT-based analysis of cellular automata, in: Proc. Italian Symp. Computational Logic, Parma, Italy, June 2004, pp. 745-754
16. A. DeHon, Very large scale spatial computing, in: Proc. Third Intl. Conf. Unconventional Models of Computation, UMC'02, Kobe, Japan, October 2002, pp. 27-37
17. Durand B. Inversion of 2D cellular automata: Some complexity results. Theoretical Computer Science 134 2 (1994) 387-401
18. Eubank S., Guclu H., Anil Kumar V., Marathe M., Srinivasan A., Toroczkai Z., and Wang N. Modelling disease outbreaks in realistic urban social networks. Nature 429 (2004) 180-184
19. Epstein J. Generative Social Science: Studies in Agent-Based Computational Modeling (2007), Princeton University Press, Princeton, NJ
20. Floreen P., and Orponen P. Attraction radii in Hopfield nets are hard to compute. Neural Computation 5 5 (1993) 812-821
21. P. Floreen, P. Orponen, Complexity issues in discrete Hopfield networks, Research Report No. A-1994-4, Department of Computer Science, University of Helsinki, 1994
22. Freedman M. Limits, logic and computation. Proceedings of the National Academy of Sciences of the United States of America 95 (1998) 95-97
23. Garzon M. Models of massive parallelism: Models of cellular automata and neural networks. EATCS Monographs on Theoretical Computer Science (1995), Springer-Verlag, Berlin
24. Gouda M., and Chang C. Proving liveness for networks of communicating finite state machines. ACM Transactions on Programming Languages and Systems 8 1 (1986) 154-182
25. Garey M.R., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), W.H. Freeman and Co., San Francisco, CA
26. Green F. NP-Complete problems in cellular automata. Complex Systems 1 3 (1987) 453-474
27. In: Gutowitz H. (Ed). Cellular Automata: Theory and Experiments (1989), North Holland, Amsterdam
28. Harel D., Kupferman O., and Vardi M.Y. On the complexity of verifying concurrent transition systems. Information and Computation 173 2 (2002) 143-161
29. Hunt III H., Marathe M., Radhakrishnan V., and Stearns R. The complexity of planar counting problems. SIAM Journal on Computing 27 4 (1998) 1142-1167
30. Höfting F., Lengauer T., and Wanke E. Processing of hierarchically defined graphs and graph families. Data Structures and Efficient Algorithms (Final Report on the DFG Special Joint Initiative). Lecture Notes in Computer Science vol. 594 (1992), Springer-Verlag, Berlin 44-69
31. Hunt III H., Marathe M., Rosenkrantz D., and Stearns R. Towards a predictive complexity theory for periodically specified problems. In: Istrate G., Percus A., and Moore C. (Eds). Computational Complexity and Statistical Physics (2006), Oxford University Press, New York, NY 285-317
32. H. Hunt III, M. Marathe, R. Stearns, Strongly-local reductions and the complexity/efficient approximability of algebra and optimization on abstract algebraic structures, in: Proc. Intl. Conf. Symbolic and Algebraic Computation, ISSAC 2001, London, Ontario, July 2001, pp. 183-191
33. H. Hunt III, R. Stearns, M. Marathe, Relational representability, local reductions and the complexity of generalized satisfiability problems, Technical Report No. LA-UR-00-6108, Los Alamos National Laboratory, April 2001
34. Impagliazzo R., Paturi R., and Zane F. Which problems have strongly exponential complexity?. Journal of Computer and System Sciences 63 4 (2001) 512-530
35. Kschischang F., Frey B., and Loeliger H. Factor graphs and the sum-product algorithm. IEEE Transactions on Information Theory 47 2 (2001) 498-519
36. D. Kempe, J. Kleinberg, E. Tardos, Influential nodes in a diffusion model for social networks, in: Proc. 32nd International Colloquium on Automata, Languages and Programming, ICALP 2005, Lisbon, Portugal, July 2005, pp. 1127-1138
37. Kohavi Z. Switching and Finite Automata Theory (1970), McGraw-Hill, New York, NY
38. S. Khanna, M. Sudan, L. Trevisan, Constraint satisfaction: The approximability of minimization problems, in: Proc. 12th IEEE Annual Conference on Computational Complexity, CCC'97, Ulm, Germany, June 1997, pp. 282-291
39. Kung H. Why systolic architectures. IEEE Computer 15 1 (1982) 37-42
40. Laubenbacher R., and Pareigis B. Decomposition and simulation of sequential dynamical systems. Advances in Applied Mathematics 30 4 (2003) 655-678
41. Laubenbacher R., and Pareigis B. Equivalence relations on finite dynamical systems. Advances in Applied Mathematics 26 3 (2001) 237-251
42. Laubenbacher R., and Stigler B. A computational algebra approach to the reverse engineering of gene regulatory networks. Journal of Theoretical Biology 229 August (2004) 523-537
43. M. Mahajan, Studies in language classes defined by different types of time-varying cellular automata, Ph.D. Thesis, Indian Institute of Technology, Madras, India, 1992
44. N. Margolus, An embedded DRAM architecture for large-scale spatial-lattice computations, in: Proc. 27th Annual Intl. Symp. Computer Architecture, ISCA 2000, Vancouver, Canada, June 2000, pp. 149-160
45. M. Marathe, Towards a predictive computational complexity theory, in: Proc. International Colloquium on Automata Languages and Programming, ICALP 2002, Malaga, Spain, July 2002, pp. 22-31
46. N. Margolus, Architecture for DRAM-based systolic computations, in: Proc. IEEE Workshop on FPGAs for Custom Computing Machines, Napa Valley, CA, April 1997, pp. 2-11
47. Mortveit H., and Reidys C. Discrete sequential dynamical systems. Discrete Mathematics 226 1-3 (2001) 281-295
48. Macy M.W., and Willer R. From factors to actors: Computational sociology and agent-based modeling. Annual Review of Sociology 28 (2002) 143-166
49. Berry B., Kiel L., and Elliott E. Adaptive agents, intelligence, and emergent human organization: Capturing complexity through agent-based modeling. Proceedings of the National Academy of Sciences 99 Suppl. 3 (2002) (special issue)
50. Newman M. The structure and function of complex networks. SIAM Review 45 2 (2003) 167-256
51. C. Nichitiu, E. Remila, Simulations of graph automata, in: Proc. Satellite Workshop on Graph Automata held in conjunction with the conference on Mathematical Foundations of Computer Science, MFCS'98, Brno, Czech Republic, August 1998
52. Orponen P. Computational complexity of neural networks: A survey. Nordic Journal of Computing 1 1 (1994) 94-110
53. P. Orponen, An overview of the computational power of recurrent neural networks, in: Proc. 9th Finnish AI Conference STeP 2000 - Millennium of AI, Espoo, Finland, 2000, pp. 89-96
54. Peng W. Deadlock detection in communicating finite state machines by even reachability analysis. Mobile Networks and Applications 2 3 (1997) 251-257
55. Reidys C. On acyclic orientations and sequential dynamical systems. Advances in Applied Mathematics 27 4 (2001) 790-804
56. Roka Z. One-way cellular automata on Cayley graphs. Theoretical Computer Science 132 1-2 (1994) 259-290
57. Rabinovich A. Complexity of equivalence problems for concurrent systems of finite agents. Information and Computation 127 2 (1997) 164-185
58. Stearns R., and Hunt III H. Power indices and easier hard problems. Mathematical Systems Theory 23 4 (1990) 209-225
59. S. Shukla, H. Hunt III, D. Rosenkrantz, R. Stearns, On the complexity of relational problems for finite state processes, in: International Colloquium on Automata Programming and Languages, ICALP 1996, Paderborn, Germany, July 1996, pp. 466-477
60. T. Schaefer, The complexity of satisfiability problems, in: Proc. 10th ACM Symposium on Theory of Computing, STOC'78, San Diego, CA, May 1978, pp. 216-226
61. Sarkar P. A brief history of cellular automata. ACM Computing Surveys 32 1 (2000) 80-107
62. Sima J., and Orponen P. General-purpose computation with neural networks: A survey of complexity theoretic results. Neural Computation 15 (2003) 2727-2778
63. Sutner K. On the computational complexity of finite cellular automata. Journal of Computer and System Sciences 50 1 (1995) 87-97
64. Sutner K. Additive automata on graphs. Complex Systems 2 6 (1988) 649-661
65. P. Tosic, G. Agha, On the computational complexity of counting fixed points in symmetric Boolean graph automata, in: Proc. Fourth Intl. Conf. Unconventional Computation, UC'05, Sevilla, Spain, October 2005, pp. 191-205
66. P. Tosic, Counting fixed points and Gardens of Eden of sequential dynamical systems on planar bipartite graphs, in: Electronic Colloquium on Computational Complexity, ECCC-TR05-091, 2005
67. Tamassia R., and Tollis I.G. Planar grid embedding in linear time. IEEE Transactions on Circuits and Systems 36 9 (1989) 1230-1234
68. Vadhan S. The complexity of counting in sparse, regular and planar graphs. SIAM Journal on Computing 31 2 (2001) 398-427
69. Valiant L. The complexity of enumeration and reliability problems. SIAM Journal on Computing 8 3 (1979) 410-421
70. L. Valiant, V. Vazirani, NP is as easy as detecting unique solutions, in: Proc. ACM Symp. on Theory of Computing, STOC'85, Newport, RI, May 1985, pp. 458-463
71. von zur Gathen J. Parallel linear algebra. In: Reif J.H. (Ed). Synthesis of Parallel Algorithms (1993), Morgan Kaufmann Publishers, San Mateo, CA 573-617 (Chapter 13)
72. In: Wolfram S. (Ed). Theory and Applications of Cellular Automata (1987), World Scientific