Analysis problems for sequential dynamical systems and communicating state machines

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2136, Issue , 2001, Pages 159-172

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

^a LOS ALAMOS NATIONAL LABORATORY   (United States)

^b State University of New York   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

COMMUNICATING STATE MACHINES; COMPUTING DEVICES; MATHEMATICAL ABSTRACTION; REACHABILITY PROBLEM; SEQUENTIAL DYNAMICAL SYSTEMS; SIMULATION SYSTEMS; STATE REACHABILITY; TRANSITION FUNCTIONS;

DYNAMICAL SYSTEMS;

EID: 84974738109     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44683-4_15     Document Type: Conference Paper

References (33)

1. R. Alur, S. Kannan, and M. Yannakakis. Communicating hierarchical state machines. Proc. 26th International Colloquium on Automata, Languages and Programming (ICALP’99), Springer Verlag, 1999.
2. S. Arora, Y. Rabani and U. Vazirani. Simulating quadratic dynamical systems is PSPACE-complete. Proc. 26th Annual ACM Symposium on the Theory of Computing (STOC’94), Montreal, Canada, May 1994, pp. 459-467.
3. C. Barrett, B. Bush, S. Kopp, H. Mortveit and C. Reidys. Sequential Dynamical Systems and Applications to Simulations. Technical Report, Los Alamos National Laboratory, Sept. 1999.
4. J. Bruck and J. Goodman. A generalized convergence theorem for neural networks. IEEE Trans. on Information Theory, Vol. 34, 1988, pp. 1089-1092.
5. C. Barrett, H. Hunt III, M. Marathe, S. Ravi, D. Rosenkrantz, R. Stearns and P. Tosic. Gardens of Eden and fixed points in sequential dynamical systems. To appear in Proc. of the International Conference on Discrete Models-Combinatorics, Computation and Geometry (DM-CCG), Paris, July 2001.
6. C. Barrett, H. Hunt III, M. Marathe, S. Ravi, D. Rosenkrantz and R. Stearns. Predecessor and permutation existence problems for sequential dynamical systems. Under preparation, May 2001.
7. C. Barrett, H. Hunt III, M. Marathe, S. Ravi, D. Rosenkrantz and R. Stearns. Elements of a theory of computer simulation V: computational complexity and universality. Under preparation, May 2001.
8. C. Barrett, H. Mortveit and C. Reidys. Elements of a theory of simulation II: sequential dynamical systems. Applied Mathematics and Computation, 1999, vol 107/2-3, pp. 121-136.
9. C. Barrett, H. Mortveit and C. Reidys. Elements of a theory of computer simulation III: equivalence of SDS. to appear in Applied Mathematics and Computation, 2000.
10. S. Buss, C. Papadimitriou and J. Tsitsiklis. On the predictability of coupled automata: an allegory about chaos. Complex Systems, 1(5), pp. 525-539, 1991
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. C. Barrett, M. Wolinsky and M. Olesen. Emergent local control properties in particleho pping traffic simulations. Proc. Traffic and Granular Flow, Julich, Germany, 1995.
13. P. Floréen and P. Orponen. Complexity issues in discrete Hopfield networks. The Computational and Learning Complexity of Neural Networks: Advanced Topics. Ian Parberry (Editor), 2000.
14. E. Goles, F. Fogelman and D. Pellegrin. Decreasing energy functions as a tool for studying threshold networks. Discrete Applied Mathematics, vol. 12, 1985, pp. 261-277.
15. F. Green. NP-complete problems in cellular automata. Complex Systems, 1(3), pp. 453-474, 1987.
16. H. Gutowitz, Ed. Cellular Automata: Theory and Experiment. North Holland, 1989.
17. H. Hunt III. On the Time and Tape Complexity of Languages. Ph.D. Thesis, Cornell University, Ithaca, NY, 1973.
18. Z. Kohavi, Switching and Finite Automata Theory, McGraw-Hill Book Company, New York, 1970.
19. R. Laubenbacher and B. Pareigis. Finite Dynamical Systems. Technical report, Department of Mathematical Sciences, New Mexico State University, Las Cruces.
20. C. Moore. Unpredictability and undecidability in dynamical systems. Physical Review Letters, 64(20), pp. 2354-2357, 1990.
21. C. Moore. Generalized shifts: unpredictability and undecidability in dynamical systems. Nonlinearity, 4, pp. 199-230, 1991.
22. H. Mortveit and C. Reidys. Discrete sequential dynamical systems. Discrete Mathematics. Accepted for publication, 2000.
23. A. Rabinovich. Checking equivalences between concurrent systems of finite state processes. International Colloquium on Automata Programming and languages (ICALP’92), LNCS Vol. 623, Springer, 1992, pp. 696-707.
24. C. Reidys. On acyclic orientations and SDS. Advances in Applied Mathematics, to appe ar.
25. C. Reidys. Sequential dynamical systems: phase space properties. Advances in Applied Mathematics, to appe ar.
26. D. Rosenkrantz and H. Hunt III. The complexity of processing hierarchical specifications. SIAM Journal on Computing, 22(3), pp. 627-649, 1993.
27. S. Shukla, H. Hunt III, D. Rosenkrantz and R. Stearns. On the Complexity of Relational Problems for Finite State Processes. Proc. International Colloquium on Automata, Languages and Programming (ICALP’96), pp. 466-477.
28. K. Sutner. Classifying circular cellular automata. Physica D, 45(1-3), pp. 386-395, 1989.
29. K. Sutner. De Bruijn graphs and linear cellular automata. Complex Systems, 5(1), pp. 19-30, 1990.
30. K. Sutner. On the computational complexity of finite cellular automata. Journal of Computer and System Sciences, 50(1), pp. 87-97, February 1995.
31. R. van Glabbeek. The linear time-branching time spectrum. Technical Report CS-R9029, Computer Science Department, CWI, Centre for Mathematics and Computer Science, Netherlands, 1990.
32. R. van Glabbeek. The linear time-branching time spectrum II (the semantics of sequential systems with silent moves). LNCS 715, 1993.
33. S. Wolfram, Ed. Theory and applications of cellular automata. World Scientific, 1987.