Composition and abstraction of logical regulatory modules: application to multicellular systems
Author(s) -
Nuno D. Mendes,
Frédéric Lang,
Yves-Stan Le Cornec,
Radu Mateescu,
Grégory Batt,
Claudine Chaouiya
Publication year - 2013
Publication title -
bioinformatics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 3.599
H-Index - 390
eISSN - 1367-4811
pISSN - 1367-4803
DOI - 10.1093/bioinformatics/btt033
Subject(s) - reachability , abstraction , computer science , modularity (biology) , theoretical computer science , equivalence (formal languages) , equivalence relation , process calculus , process (computing) , abstraction layer , set (abstract data type) , programming language , mathematics , software , philosophy , epistemology , discrete mathematics , biology , genetics , pure mathematics
Logical (Boolean or multi-valued) modelling is widely used to study regulatory or signalling networks. Even though these discrete models constitute a coarse, yet useful, abstraction of reality, the analysis of large networks faces a classical combinatorial problem. Here, we propose to take advantage of the intrinsic modularity of inter-cellular networks to set up a compositional procedure that enables a significant reduction of the dynamics, yet preserving the reachability of stable states. To that end, we rely on process algebras, a well-established computational technique for the specification and verification of interacting systems.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom