Complexity of reachability problems for finite discrete dynamical systems
نویسندگان
چکیده
منابع مشابه
Entropy operator for continuous dynamical systems of finite topological entropy
In this paper we introduce the concept of entropy operator for continuous systems of finite topological entropy. It is shown that it generates the Kolmogorov entropy as a special case. If $phi$ is invertible then the entropy operator is bounded with the topological entropy of $phi$ as its norm.
متن کاملReachability problems for sequential dynamical systems with threshold functions
A sequential dynamical system (SDS) over a domain is a triple , where (i) is an undirected graph with nodes with each node having a state value from , (ii) "!"!"! $#&% is a set of local transition functions with $' denoting the local transition function associated with node ( ' and (iii) is a permutation of (i.e., a total order on) the nodes in . A single SDS transition is obtained by updating ...
متن کاملReachability in Biochemical Dynamical Systems by Quantitative Discrete Approximation
In this paper a novel computational technique for finite discrete approximation of continuous dynamical systems suitable for a significant class of biochemical dynamical systems is introduced. The method is parameterized in order to affect the imposed level of approximation provided that with increasing parameter value the approximation converges to the original continuous system. By employing ...
متن کاملPROJECTED DYNAMICAL SYSTEMS AND OPTIMIZATION PROBLEMS
We establish a relationship between general constrained pseudoconvex optimization problems and globally projected dynamical systems. A corresponding novel neural network model, which is globally convergent and stable in the sense of Lyapunov, is proposed. Both theoretical and numerical approaches are considered. Numerical simulations for three constrained nonlinear optimization problems a...
متن کاملReachability problems for communicating finite state machines
1. Introduction 2. Introductory examples 3. Communicating finite state machines 4. Reachability properties 5. Reachability analysis and abstract flow control 6. Affine SR-machines 7. Undecidable problems 8. Rational channels for cyclic protocols 9. Recognizable channels for general protocols 10. Abstract flow control in general graphs 11. Recapitulation and conclusions Appendix: Post's tag syst...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2006
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2006.03.006