Analysis problems for sequential dynamical systems and communicating state machines

DOI10.1007/3-540-44683-4_15MaRDI QIDQ4785459zbMATH OpenFDO

Authors S. S. Ravi, R. E. Stearns, H. B. III Hunt, Madhav V. Marathe, Daniel J. Rosenkrantz, Christopher L. Barrett

Publication date 10 March 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44683-4_15

zbMATH Keywords

cellular automatadichotomy between classes of SDSefficiently solvablereachability problems

Mathematics Subject Classification ID

Dynamical aspects of cellular automata (37B15) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Complexity of reachability problems for finite discrete dynamical systems
• Reachability problems for sequential dynamical systems with threshold functions.
• On some special classes of sequential dynamical systems
• scientific article; zbMATH DE number 2046041
• Elements of a theory of simulation. II: Sequential dynamical systems.

Cited in

(6)

• Reachability problems for sequential dynamical systems with threshold functions.
• On some special classes of sequential dynamical systems
• ETS IV: Sequential dynamical systems: fixed points, invertibility and equivalence
• scientific article; zbMATH DE number 2046041 (Why is no real title available?)
• Modeling and analyzing social network dynamics using stochastic discrete graphical dynamical systems
• Complexity of reachability problems for finite discrete dynamical systems

This page was built for publication: Analysis problems for sequential dynamical systems and communicating state machines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4785459)