Dichotomy results for fixed-point existence problems for boolean dynamical systems

Mathematics in Computer Science

Volumn 1, Issue 3, 2008, Pages 487-505

  Kosub, Sven ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

Algorithms and complexity; Discrete dynamical systems; Fixed points

Indexed keywords

EID: 49549109186     PISSN: 16618270     EISSN: 16618289     Source Type: Journal    
DOI: 10.1007/s11786-007-0038-y     Document Type: Article

References (34)

1. E. Abad, P. Grosfils, and G. Nicolis. Nonlinear reactive systems on a lattice viewed as Boolean dynamical systems. Physical Review E, 63(041102), 2001.
2. C. L. Barrett, B. W. Bush, S. Kopp, H. S. Mortveit, and C. M. Reidys. Sequential dynamical systems and applications to simulations. In Proceedings of the 33rd Annual Simulation Symposium (SS'00), pages 245-253. IEEE Computer Society Press, Washington, D.C., 2000.
3. C. L. Barrett, S. Eubank, M. V. Marathe, H. S. Mortveit, and C. M. Reidys. Science and engineering of large socio-technical simulations. In Proceedings of the 2000 Western Multi Conference on Computer Simulation (WMC'00). The Society for Computer Simulation International, San Diego, CA, 2000.
4. 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(4):381-408, 2003.
5. C. L. Barrett, H. B. Hunt III, M. V. Marathe, S. S. Ravi, D. J. Rosenkrantz, and R. E. Stearns. Predecessor and permutation existence problems for sequential dynamical systems. In Proceedings of the Conference on Discrete Models for Complex Systems (DMCS'03), volume AB of Discrete Mathematics and Theoretical Computer Science Proceedings, pages 69-80, 2003.
6. C. L. Barrett, H. B. Hunt III, M. V. Marathe, S. S. Ravi, D. J. Rosenkrantz, and R. E. Stearns. Reachabillity problems for sequential dynamical systems with threshold functions. Theoretical Computer Science, 295(1-3):41-64, 2003.
7. C. L. Barrett, H. B. Hunt III, M. V. Marathe, S. S. Ravi, D. J. Rosenkrantz, and R. E. Stearns. Complexity of reachabillity problems for finite discrete dynamical systems. Journal of Computer and System Sciences, 72(7):1317-1345, 2006.
8. C. L. Barrett, H. B. Hunt III, M. V. Marathe, S. S. Ravi, D. J. Rosenkrantz, R. E. Stearns, and P. T. Tošić. Gardens of Eden and fixed points in sequential dynamical systems. In Proceedings of the 1st International Conference on Discrete Models: Combinatorics, Computation and Geometry (DM-CCG'01), volume AA of Discrete Mathematics and Theoretical Computer Science Proceedings, pages 241-259, 2001.
9. C. L. Barrett, H. S. Mortveit, and C. M. Reidys. Elements of a theory of computer simulation II: Sequential dynamical systems. Applied Mathematics and Computation, 107(2-3):121-136, 2000.
10. C. L. Barrett and C. M. Reidys. Elements of a theory of computer simulation I: Sequential CA over random graphs. Applied Mathematics and Computation, 98(2-3):241-259, 1999.
11. E. Böhler, N. Creignou, S. Reith, and H. Vollmer. Playing with Boolean blocks, part I: Post's lattice with applications to complexity theory. ACM SIGACT News, 34(4):38-52, 2003.
12. S. R. Buss, C. H. Papadimitriou, and J. N. Tsitsiklis. On the predictability of coupled automata: An allegory about chaos. Complex Systems, 5:525-539, 1991.
13. K. Cattell and M. J. Dinneen. A characterization of graphs with vertex cover up to five. In Proceeding of the International Workshop on Orders, Algorithms, and Applications (ORDAL'94), volume 831 of Lecture Notes in Computer Science, pages 86-99. Springer-Verlag, Berlin, 1994.
14. R. Diestel. Graph Theory. Graduate Texts in Mathematics. Springer-Verlag, Berlin, 3rd edition, 2003.
15. E. C. Freuder. Complexity of k-tree structured constraint satisfaction problems. In Proceedings of the 8th National Conference on Artificial Intelligence (AAAI'90), pages 4-9. AAAI Press/The MIT Press, Menlo Park, CA, 1990.
16. M. Garzon. Models of Massive Parallelism: Analysis of Cellular Automata and Neural Networks. Texts in Theoretical Computer Science. An EATCS Series. Springer-Verlag, Berlin, 1995.
17. F. Green. NP-complete problems in cellular automata. Complex Systems, 1(3):453-474, 1987.
18. T. G. Griffin and G. T. Wilfong. An analysis of BGP convergence properties. ACM SIGCOMM Computer Communication Review, 29(4):277-288, 1999.
19. D. Lichtenstein. Planar formulae and their uses. SIAM Journal on Computing, 11(2):329-343, 1982.
20. C. Moore. Unpredictability and undecidability in dynamical systems. Physical Review Letters, 64(20):2354-2357, 1990.
21. P. Pal Chaudhuri, D. R. Chowdhury, S. Nandi, and S. Chattopadhyay. Additive Cellular Automata: Theory and Applications, volume I. IEEE Computer Society Press, Washington, D.C., 1997.
22. R. Pöschel and L. A. Kaluzhnin. Funktionen- und Relationenalgebren. Ein Kapitel der diskreten Mathematik, volume 15 of Mathematische Monographien. Deutscher Verlag der Wissenschaften, Berlin, 1979.
23. E. L. Post. The two-valued iterative systems of mathematical logic. Annals of Mathematical Studies, 5:1-122, 1941.
24. N. Robertson and P. D. Seymour. Graph minors. V. Excluding a planar graph. Journal of Combinatorial Theory, Series B, 41(1):92-114, 1986.
25. N. Robertson and P. D. Seymour. Graph minors. XIII. The disjoint path problem. Journal of Combinatorial Theory, Series B, 63(1):65-110, 1995.
26. N. Robertson and P. D. Seymour. Graph minors. XX. Wagner's conjecture. Journal of Combinatorial Theory, Series B, 92(2):325-357, 2004.
27. K. Sutner. On the computational complexity of finite cellular automata. Journal of Computer and System Sciences, 50(1):87-97, 1995.
28. P. T. Tošić. On complexity of counting fixed point configurations in certain classes of graph automata. Electronic Colloquium on Computational Complexity, 12(51), 2005.
29. P. T. Tošić. 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, 17(5):1179-1203, 2006.
30. P. T. Tošić and G. A. Agha. On computational complexity of counting fixed points in symmetric Boolean graph automata. In Proceedings of the 4th International Conference on Unconventional Computation (UC'05), volume 3699 of Lecture Notes in Computer Science, pages 191-205. Springer-Verlag, Berlin, 2005.
31. J. von Neumann. Theory of Self-Reproducing Automata. A.W. Burks (ed.). University of Illinois Press, Champaign, IL, 1966.
32. S. Wolfram. Twenty problems in the theory of cellular automata. Physica Scripta, T9:170-183, 1985.
33. S. Wolfram. Cellular Automata and Complexity. Collected Papers. Addison-Wesley Publishing Co., Reading, MA, 1994.
34. I. E. Zverovich. Characterizations of closed classes of Boolean functions in terms of forbidden subfunctions and Post classes. Discrete Applied Mathematics, 149(1-3):200-218, 2005.