Identification problems for Boolean networks and Boolean control networks

Abstract

In this paper we address various forms of identification problems for Boolean networks (BNs) and for Boolean control networks (BCNs). For the former, we assume to have a set of infinite or finite support output trajectories and we want to identify a BN compatible with those trajectories. Conditions for the identified BN to coincide (up to a relabeling) with the original BN are provided. For BCNs, the problem of identifying a BCN compatible with a given family of corresponding finite support input/output trajectories is explored.