Permutational Logical Networks

A special class of permutational logical networks is considered. Dynamic models of these networks have a phase space with only fixed points and cyclic trajectories. Within the framework of the Boolean constraint method, the available dynamic equations allow one to define the permutability property as a quantified Boolean formula or a system of Boolean equations. Examples of linear and nonlinear permutational logical networks are presented. A technology for studying the permutability property based on modern QSAT and SAT solvers is described.