Sequential dynamical systems with threshold functions.
- Christopher L.
- Madhav V.
- Daniel J.
- Richard E.
A sequential dynamical system (SDS) (see [BH+01] and the references therein) consists of an undirected graph G(V,E) where each node {nu} {epsilon} V is associated with a Boolean state (s{sub {nu}}) and a symmetric Boolean function f{sub {nu}} (called the local transition function at {nu}). The inputs to f{sub {nu}} are s{sub {nu}} and the states of all the nodes adjacent to {nu}. In each step of the SDS, the nodes update their state values using their local transition functions in the order specified by a given permutation {pi} of the nodes. A configuration of the SDS is an n-tuple (b{sub 1}, b{sub 2}...,b{sub n}) where n = |V| and b{sub i} {epsilon} {l_brace}0,1{r_brace} is the state value of node {nu}{sub i}. The system starts in a specified initial configuration and each step of the SDS produces a (possibly new) configuration.
- Research Organization:
- Los Alamos National Laboratory (LANL), Los Alamos, NM (United States)
- Sponsoring Organization:
- USDOE
- OSTI ID:
- 975700
- Report Number(s):
- LA-UR-01-4696; TRN: US201018%%788
- Resource Relation:
- Conference: Submitted to: ACM-SIAM Symposium on Discrete Algorithms (SODA 02) San Fransisco, CA, January 2002
- Country of Publication:
- United States
- Language:
- English
Similar Records
Analysis problems for sequential dynamical systems and communicating state machines
Predecessor and permutation existence problems for sequential dynamical systems