Coexistence of Periods in Parallel and Sequential Boolean Graph Dynamical Systems over Directed Graphs

Abstract

In this work, we solve the problem of the coexistence of periodic orbits in homogeneous Boolean graph dynamical systems that are induced by a maxterm or a minterm (Boolean) function, with a direct underlying dependency graph. Specifically, we show that periodic orbits of any period can coexist in both kinds of update schedules, parallel and sequential. This result contrasts with the properties of their counterparts over undirected graphs with the same evolution operators, where fixed points cannot coexist with periodic orbits of other different periods. These results complete the study of the periodic structure of homogeneous Boolean graph dynamical systems on maxterm and minterm functions.