Sequential dynamical systems with threshold functions.

Conference · Mon Jan 01 04:00:00 EST 2001

OSTI ID:975700

Barrett, C L ^[1]; Hunt, H B; Marathe, M V ^[2]; Ravi, S S; Rosenkrantz, D J ^[3]; Stearns, R E ^[4]

---

1. Christopher L.
2. Madhav V.
3. Daniel J.
4. 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
• Sponsoring Organization: DOE
• OSTI ID: 975700
• Report Number(s): LA-UR-01-4696
• Country of Publication: United States
• Language: English

Related Subjects

97 MATHEMATICS AND COMPUTING
ALGORITHMS
COMPUTERS
CONFIGURATION