Boolean equation

<< Click to Display Table of Contents >>

Navigation:  Welcome to SELMO  > Method > The control example > Formal specifications >

Boolean equation

In the Boolean equation, the statements about the outputs are represented. And so a truth table for the logic is created. From this, the control algorithm can be derived. The control algorithm maps the input (E1, E2, E3) to the output (A1, A2).

NeuesElement234

NeuesElement233

 

E1

E2

E3

A1

A2

0

0

0

0

0

0

0

1

0

0

0

1

0

0

0

0

1

1

0

1

1

0

0

0

0

1

0

1

1

0

1

1

0

0

0

1

1

1

0

0

 

Table 7-2 Truth table of the control algorithm

 

NeuesElement263

 

In this formal specification, a logic control as described in chapter 4 is presented. The outputs are directly dependent on the inputs and no dynamic elements are included.