Boolean Networks are Interaction Graphs augmented with a set of functions (one for each vertex of the graph), known as updating functions. They express the evolution of the state of the Interaction graph.

You can load a Boolean Network by typing the functions associated to each node of the Interaction Graph or uploading a file (Allowed extensions: .bn, .cnet, .blif).

f_{Node1} := Node2 AND Node3

f_{Node2} := NOT Node1

f_{Node3} := Node2 OR Node3

f

f

Node1 = Node2 & Node3

(Note: the syntax &, |, ! is used insted of AND, OR, NOT).

When you wrote all the functions, click the Draw button to print the Interaction Graph.

Node1, Node2 & Node3

Node2, !Node1

Node3, Node2 | Node3

# The .v is needed to specify the cardinality of the Interaction Graph

**.v 3**

# We begin with the first block

# First line is a sequence of number starting with .n

# The first number is the index of the Node, then the number of variables involved in the formula and finally the indexes of the variables. Below, we write the truth table of the formula

**.n 1 2 2 3**

11 1

10 0

01 0

00 0

# If we want to keep the names of the nodes, we can add a comment line before each block

# 1 = StrangeName

**.n 2 1 1**

0 1

1 0

# To avoid memory waste, we can minimize the size of the truth table, merging entries with the same output with a single bit of difference and replacing the bit with a dash. For example, this is the truth table of the third node

# 11 1

# 10 1

# 01 1

# 00 0

# And this is the minimized truth table

**.n 3 2 2 3**

1- 1

-1 1

00 0

# We begin with the first block

# First line is a sequence of number starting with .n

# The first number is the index of the Node, then the number of variables involved in the formula and finally the indexes of the variables. Below, we write the truth table of the formula

11 1

10 0

01 0

00 0

# If we want to keep the names of the nodes, we can add a comment line before each block

# 1 = StrangeName

0 1

1 0

# To avoid memory waste, we can minimize the size of the truth table, merging entries with the same output with a single bit of difference and replacing the bit with a dash. For example, this is the truth table of the third node

# 11 1

# 10 1

# 01 1

# 00 0

# And this is the minimized truth table

1- 1

-1 1

00 0

Ensure the file ends with some blank lines.

.n 1 2 2 3

11 1

.n 2 1 1

0 1

.n 3 2 2 3

1- 1

-1 1

Ensure the file ends with some blank lines.

Clicking on the button , we send to the server the request and it computes the periodic behaviours of the Automata. Then Attractors are printed on the right side of the screen.
For more details on the search, click here.