Reaction Networks to Boolean Networks: Exact Boolean Abstraction for Linear Equation Systems - INRIA - Institut National de Recherche en Informatique et en Automatique Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2021

Reaction Networks to Boolean Networks: Exact Boolean Abstraction for Linear Equation Systems

Résumé

We study the problem of how to convert reaction networks into boolean networks. We start from the sign abstraction of the ODE semantics of reaction network, and show that it can be captured by a quasi-boolean network, a generalization of boolean networks that we introduce. We then show that any quasi-boolean networks can be converted into a boolean networks by using John’s overapproximation. Our main technical contribution is a new rewrite algorithm that make linear equation systems exact with respect to the boolean abstraction. We apply our exact rewriting for improving the precision of the conversion of quasi-boolean to boolean networks, also in the general nonlinear case. Thereby we improve our compiler from reaction networks to boolean networks as well.
Fichier principal
Vignette du fichier
1.pdf (473.52 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-02279942 , version 1 (13-05-2020)
hal-02279942 , version 2 (15-05-2020)
hal-02279942 , version 3 (07-05-2021)
hal-02279942 , version 4 (11-05-2021)
hal-02279942 , version 5 (12-05-2021)
hal-02279942 , version 6 (26-07-2021)
hal-02279942 , version 7 (15-09-2021)
hal-02279942 , version 8 (17-05-2022)
hal-02279942 , version 9 (24-06-2022)

Identifiants

Citer

Emilie Allart, Joachim Niehren, Cristian Versari. Reaction Networks to Boolean Networks: Exact Boolean Abstraction for Linear Equation Systems. 2021. ⟨hal-02279942v3⟩
574 Consultations
362 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More