On limitations of using scalar equations for analyzing synchronous Boolean networks

Abstract EN

A total description of a synchronous Boolean network is typically achieved by a matrix recurrence equation.

A simpler description is possible when such a matrix equation is replaced by a scalar equation or a reduced scalar equation.

Unfortunately, the scalarequation technique suffers from several shortcomings and limitations, both in procedure and results.

We discuss these shortcomings and support our arguments with two illustrative examples.