On the complexity of counting fixed points and gardens of eden in sequential dynamical systems on planar bipartite graphs

International Journal of Foundations of Computer Science

Volumn 17, Issue 5, 2006, Pages 1179-1203

  Tošić, Predrag T ^a,b  

^a Open Systems Laboratory   (United States)

^b University of Illinois at Urbana Champaign   (United States)

Author keywords

P completeness; Cellular and graph automata; Computational complexity; Discrete dynamical systems; Enumeration problems

Indexed keywords

EID: 33748803294     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054106004339     Document Type: Article

References (55)

1. S. Amoroso and Y. Patt. "Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures", J. of Computer and System Sciences (JCSS), vol. 6, pp. 448-464, 1972
2. R. J. Bagley and L. Glass. "Counting and Classifying Attractors in High Dimensional Dynamical Systems", Journal of Theoretical Biology, vol. 183, pp. 269-284, 1996
3. C. Barrett, B. Bush, S. Kopp, H. Mortveit, C. Reidys. "Sequential Dynamical Systems and Applications to Simulations", Technical Report, Los Alamos National Laboratory, September 1999
4. C. Barrett, M. Marathe, H. Mortveit, C. Reidys, J. Smith, S.S. Ravi. "AdhopNET: Advanced Simulation-based Analysis of Ad-Hoc Networks", Los Alamos Unclassified Internal Report, 2000
5. C. Barrett, H. B. Hunt III, M. V. Marathe, S. S. Ravi, D. J. Rosenkrantz, R. E. Stearns. "Dichotomy Results for Sequential Dynamical Systems", Los Alamos National Laboratory Report, LA-UR-00-5984, 2000
6. C. Barrett, H. B. Hunt III, M. V. Marathe, S. S. Ravi, D. J. Rosenkrantz, R. E. Stearns. "Predecessor and Permutation Existence Problems for Sequential Dynamical Systems", Los Alamos National Laboratory Report, LA-UR-01-668, 2001
7. C. Barrett, H. B. Hunt III, M. V. Marathe, S. S. Ravi, D. J. Rosenkrantz, R. E. Stearns. "Reachability problems for sequential dynamical systems with threshold functions", Theoretical Computer Science, vol. 295, issues 1-3, pp. 41-64, February 2003
8. C. Barrett, H. B. Hunt III, M. V. Marathe, S. S. Ravi, D. J. Rosenkrantz, R. E. Stearns, P. T. Tosic. "Gardens of Eden and Fixed Points in Sequential Dynamical Systems", Proc. AA (DM-CCG), spec. ed. of Discrete Mathematics and Theoretical Computer Science (DMTCS), pp. 95-110, 2001
9. C. Barrett, H. Mortveit, and C. Reidys. "Elements of a theory of simulation II: sequential dynamical systems" Applied Mathematics and Compututation, vol. 107 (2-3), pp. 121-136, 2000
10. C. Barrett, H. Mortveit and C. Reidys. "Elements of a theory of computer simulation III: equivalence of SDS", Applied Mathematics and Computation, vol. 122, pp. 325-340, 2001
11. C. Barrett and C. Reidys. "Elements of a theory of computer simulation I: sequential CA over random graphs" Applied Mathematics and Computation, vol. 98, pp. 241-259, 1999
12. R. Beckman et. al. "TRANSIMS - Release 1.0 - The Dallas-Forth Worth case study", Tech. Report LA UR 97-4502, Los Alamos National Laboratory, 1999
13. S. Buss, C. Papadimitriou and J. Tsitsiklis. "On the predictability of coupled automata: An allegory about Chaos", Complex Systems, vol. 1 (5), pp. 525-539, 1991
14. (Preliminary version appeared in Proc. 31st Annual IEEE Symposium on Foundations of Computer Science (FOCS), October 1990)
15. M. R. Garey and D. S. Johnson. "Computers and Intractability: A Guide to the Theory of NP-completeness" W. H. Freeman and Co., San Francisco, CA, 1979
16. P. Gacs. "Deterministic computations whose history is independent of the order of asynchronous updating", Tech. Report, Computer Science Dept, Boston University, 1997
17. M. Garzon. "Models of Massive Parallelism: Analysis of Cellular Automata and Neural Networks", Springer, 1995
18. M. Gouda, C. Chang. "Proving Liveness for Networks of Communicating Finite State Machines." ACM Transactions on Programming Languages and Systems (TOPLAS) vol. 8 (1), pp. 154-182, 1986
19. E. Goles, S. Martinez. "Neural and Automata Networks: Dynamical Behavior and Applications", Math, and Its Applications series (vol. 58), Kluwer, 1990
20. E. Goles, S. Martinez (editors). "Cellular Automata and Complex Systems", Non-linear Phenomena and Complex Systems series, Kluwer, 1999
21. F. Green. "NP-Complete Problems in Cellular Automata", Complex Systems, vol. 1 (3), pp. 453-474, 1987
22. H. Gutowitz (Editor). "Cellular Automata: Theory and Experiment", North Holland, 1989
23. J. J. Hopfield. "Neural networks and physical systems with emergent collective computational abilities", Proc. Nat'1 Academy Sci. USA, vol. 79, pp. 2554-2558, 1982
24. J. J. Hopfield, D. W. Tank. "Neural computation of decisions in optimization problems", Biological Cybernetics, vol. 52, pp. 141-152, 1985
25. B. Huberman and N. Glance. "Evolutionary games and computer simulations" Proc. National Academy of Sciences, 1999
26. H. B. Hunt, M. V. Marathe, V. Radhakrishnan, R. E. Stearns. "The Complexity of Planar Counting Problems", SIAM J. Computing, vol. 27, pp. 1142-1167, 1998
27. L.P. Hurd, "On Invertible Cellular Automata" Complex Systems, vol. 1(1), pp. 69-80, 1987
28. T. E. Ingerson and R. L. Buvel. "Structure in asynchronous cellular automata", Physica D: Nonlinear Phenomena, vol. 10 (1-2), pp. 59 - 68, January 1984
29. M. Jerrum. "Two-dimensional monomer-dimer systems are computationally intractable", J. Statist. Physics, vol. 48, pp. 121-134, 1987 (Erratum in vol. 59, pp. 1087-1088, 1990)
30. M. Jerrum, A. Sinclair. "Approximating the permanent", SIAM J. Computing vol. 18, pp. 1149-1178, 1989
31. M. Jerrum, A. Sinclair. "Polynomial-time approximation algorithms for the Ising model", SIAM J. Computing, vol. 22, pp. 1087- 116, 1993
32. R. Laubenbacher, B. Pareigis. "Finite Dynamical Systems", Tech. report, Dept. of Mathematical Sciences, New Mexico State University, Las Cruces, N. Mexico, 2000
33. B. Martin. "A Geometrical Hierarchy of Graphs via Cellular Automata", Proc. MFCS'98 Satellite Workshop on Cellular Automata, Brno, Czech Republic, August 1998
34. C. Moore. "Unpredictability and undecidability in dynamical systems", Physical Review Letters, vol. 64 (20), pp. 2354-2357, 1990
35. H. Mortveit, C. Reidys. "Discrete, sequential dynamical systems", Discrete Mathematics, vol. 226, pp. 281-295, 2001
36. J. Myhill. "The converse of Moore's Garden-of-Eden theorem", Proc. Amer. Math. Society, vol. 14, pp. 685-686, 1963
37. C. Nichitiu and E. Remila. "Simulations of Graph Automata", Proc. MFCS'98 Satellite Workshop on Cellular Automata, Brno, Czech Republic, August 1998
38. C. Papadimitriou. "Computational Complexity", Addison-Wesley, Reading, Massachusetts, 1994
39. C.M. Reidys. "On Acyclic Orientations & Sequential Dynamical Systems", Los Alamos National Laboratory Report, LA-UR-01-598, 2001
40. Z. Roka. "One-way cellular automata on Cayley graphs", Theoretical Computer Science, vol. 132 (1-2), pp. 259-290, September 1994
41. D. Roth. "On the Hardness of Approximate Reasoning", Artificial Intelligence, vol. 82, pp. 273-302, 1996
42. K. Sutner. "On the computational complexity of finite cellular automata", Journal of Computer and System Sciences (JCSS), vol. 50 (1), pp. 87-97, February 1995
43. K. Sutner. "Computation theory of cellular automata", Proc. MFCS'98 Satellite Workshop on Cellular Automata, Bruno, Czech Republic, August 1998
44. C. Schittenkopf, G. Deco and W. Brauer. "Finite automata-models for the investigation of dynamical systems" Information Processing Letters, vol. 63 (3), pp. 137-141, August 1997
45. S. Toda. "PP is as Hard as the Polynomial-Time Hierarchy", SIAM J. Computing, vol. 20 (5), pp. 865-877, 1991
46. P. Tosic. "On Complexity of Counting Fixed Point Configurations in Certain Classes of Graph Automata", Electronic Colloquium on Computational Complexity, ECCC TR05-051, April 2005
47. P. Tosic. "On Counting Fixed Point Configurations in Star Networks", Advances in Parallel and Distributed Computing Models workshop in Proc. of the 19th IEEE Int'l Parallel and Distributed Processing Symp., April 2005 (CD-Rom)
48. P. Tosic, G. Agha. "Concurrency vs. Sequential Interleavings in 1-D Threshold Cellular Automata", Advances in Parallel and Distributed Computing Models workshop, in Proc. of the 18th IEEE Int'l Parallel and Distributed Processing Symp., April 2004 (CD-Rom)
49. P. Tosic, G. Agha. "Characterizing Configuration Spaces of Simple Threshold Cellular Automata", Proc. 6th Int'l Conf. on Cellular Automata for Research and Industry (ACRI'04), Springer's Lecture Notes in Computer Sceince series, vol. 3305, pp. 861-870, October 2004
50. TRANSIMS: TRansportation ANalysis and SIMulation System, Los Alamos National Laboratory, Los Alamos, USA. See http://www-transims.tsasa.lanl.gov
51. S. Vadhan. "The Complexity of Counting in Sparse, Regular and Planar Graphs", SIAM J. Computing, vol. 31 (2), pp. 398-427, 2001
52. L. Valiant. "The Complexity of Computing the Permanent", Theoretical Computer Science, vol. 8, pp. 189-201, 1979
53. L. Valiant. "The Complexity of Enumeration and Reliability Problems", SIAM J. Computing, vol. 8 (3), pp. 410-421, 1979
54. S. Wolfram. "Theory and applications of cellular automata"', World Scientific, 1986
55. S. Wolfram (ed.). "Cellular Automata and Complexity (collected papers)", Addison-Wesley, 1994