Computational Complexity of Minimal Trap Spaces in Boolean Networks - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2023

Computational Complexity of Minimal Trap Spaces in Boolean Networks

Résumé

A Boolean network (BN) is a discrete dynamical system defined by a Boolean function that maps to the domain itself. A trap space of a BN is a generalization of a fixed point, which is defined as the sub-hypercubes closed by the function of the BN. A trap space is minimal if it does not contain any smaller trap space. Minimal trap spaces have applications for the analysis of attractors of BNs with various update modes. This paper establishes the computational complexity results of three decision problems related to minimal trap spaces: the decision of the trap space property of a sub-hypercube, the decision of its minimality, and the decision of the membership of a given configuration to a minimal trap space. Under several cases on Boolean function representations, we investigate the computational complexity of each problem. In the general case, we demonstrate that the trap space property is coNP-complete, and the minimality and the membership properties are $Π_2^{\text P}$-complete. The complexities drop by one level in the polynomial hierarchy whenever the local functions of the BN are either unate, or are represented using truth-tables, binary decision diagrams, or double DNFs (Petri net encoding): the trap space property can be decided in a polynomial time, whereas deciding the minimality and the membership are coNP- complete. When the BN is given as its functional graph, all these problems are in P.

Dates et versions

hal-04309014 , version 1 (27-11-2023)

Identifiants

Citer

Kyungduk Moon, Kangbok Lee, Loïc Paulevé. Computational Complexity of Minimal Trap Spaces in Boolean Networks. 2023. ⟨hal-04309014⟩

Collections

CNRS TDS-MACS ANR
11 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More