An Algorithm for Counting the Fixed Point Orbits of an AND-OR Dynamical System with Symmetric Positive Dependency Graph

Abstract

In this paper we present an algorithm which counts the number of fixed point orbits of an AND-OR dynamical system. We further extend the algorithm in order to list all its fixed point orbits (FPOs) in polynomial time on the number of FPOs of the system.

Boolean Networks Models in Science and Engineering

“…In [3], Mezzini and Pelayo present an algorithm for counting the fixed points in AND-OR symmetric positive Boolean networks which are synchronously updated. They use a greedy strategy and recursion to design such an algorithm and prove its correctness.…”