Incremental and unifying modelling formalism for biological interaction networks
 Anastasia Yartseva^{1}Email author,
 Hanna Klaudel^{1},
 Raymond Devillers^{2} and
 François Képès^{3}
DOI: 10.1186/147121058433
© Yartseva et al; licensee BioMed Central Ltd. 2007
Received: 15 June 2006
Accepted: 08 November 2007
Published: 08 November 2007
Abstract
Background
An appropriate choice of the modeling formalism from the broad range of existing ones may be crucial for efficiently describing and analyzing biological systems.
Results
We propose a new unifying and incremental formalism for the representation and modeling of biological interaction networks. This formalism allows automated translations into other formalisms, thus enabling a thorough study of the dynamic properties of a biological system. As a first illustration, we propose a translation into the R. Thomas' multivalued logical formalism which provides a possible semantics; a methodology for constructing such models is presented on a classical benchmark: the λ phage genetic switch. We also show how to extract from our model a classical ODE description of the dynamics of a system.
Conclusion
This approach provides an additional level of description between the biological and mathematical ones. It yields, on the one hand, a knowledge expression in a form which is intuitive for biologists and, on the other hand, its representation in a formal and structured way.
Background
Often, modeling approaches in biology try to fit the data into the Procrustean bed of a particular modeling formalism [1–5]. However, if the area of interest changes, the modeling process has to be continued (or even restarted) using a different modeling language, more adapted to the new area. An appropriate choice of the modeling formalism may be crucial for efficiently describing biological systems, avoiding to change the description language and permitting to reuse the previous work.
In this paper, we propose a modeling formalism for the biologists that enables the expression of various types of biological knowledge in a formal manner and its translation into target formalisms for analysis or simulation. It aims at satisfying the following requirements:

universality: the integration of various kinds of biological data available today;

parsimony: the simplest possible representation of the data;

incrementality: the construction of more complex models from simpler ones;

precision: expression of relations in a nonambiguous (mathematical) way;

transposability: formal rules for the translation of the information contained in the model into commonly used (target) modeling formalisms.
In such a formalism, the model can be seen rather as a wellorganised knowledge base of information about the biological system. Every unit of information (which has no biological sense when divided) inside the model can be called a data. In this approach, we assume that there is neither contradictory nor "bad" data. In other words, every measurement, every observation may be true in some context.
Our approach, called Modular Interaction Network (MIN), is a formalism designed to represent biological data, having a bipartite network structure and admitting a graphical representation, even if not focused on it. MIN enables the integration of microscopic (molecular interactions) and macroscopic (system states) data, thus allowing to provide the desired level of abstraction. This abstraction allows to avoid the rather common problem of explosion of the model complexity [6]. MIN has a limited number of node and edges types, which enables to represent biological networks in a simple way, even if more detailed information can also be stored and recovered. MIN suits for the representation of genetic regulation as well as of metabolism with multimolecular biological processes, in a natural and incremental manner. MIN is also provided with algorithms enabling a translation to two classical modeling formalisms: multilevel logical modeling [7] and differential equations. These translations can be performed at any stage of the modeling process.
The paper is structured as follows. After recalling the biology of the λ phage, which will be used as a running example, the formal MIN model is introduced. Next, the multilevel logical approach is first recalled and then used as a semantics of MIN. In Results section, the translation from MIN into multilevel logical approach is presented and extensively illustrated on the λ phage example. A translation to ordinary differential equations is then sketched. Finally, comparison with previous work, perspectives and some concluding remarks are presented.
Biology of λ phage
In order to illustrate our approach, we shall use as a running example a classical biological benchmark: the genetic switch of the λ phage, which will be presented first.
The λ phage is a virus which infects the Escherichia coli bacteria. It turns out that a lot of quantitative and qualitative information is now available on it, so that it has become a benchmark organism and plays a central role in modeling [8, 1, 5, 9, 3, 4, 10].
When a λ phage encounters a bacterium, it can attach itself to specific receptors on the bacterial membrane. At this moment, the virus genome enters the bacterium. Then, two alternative pathways are possible:

lytic pathway: the virus uses the host machinery in order to replicate its genetic material and create new viruses. This phase takes about 45 minutes, then the bacterium is destroyed and about one hundred viruses are released in the external media (Figure 1(a)).

lysogenic pathway: the virus integrates its genetic material in the bacterial genome. There is no production of viruses. The bacterium is said to be lysogenised. The virus can stay indefinitely in the genome of its host. But there exists an escape mechanism: in some cases, the virus can extract itself from the bacterial genome and enter a lytic phase as a response to some stimuli (Figure 1(b)).
A small region of the viral genome controls the decision between lytic or lysogenic pathway. This region is composed of two genes and their two promoters (sites of regulation of the gene expression) and is referred to as the genetic switch region (see Figure 1). The decision results from the competition between two major proteins:

the first one is referred to as CRO, encoded by gene cro, and expressed during lytic phase.

the second one is called λ repressor, referred to as CI. It is encoded by gene cI, and it can activate other genes, including itself, and repress others. cI is expressed during lysogenic phase.
Note that the competition between CI and CRO is also influenced by the host environment. The host environment is captured through CI and CRO and their influence on the regulator region, i.e., the genetic switch.
Methods
Modular Interaction Network (MIN)
Modular Interaction Network (MIN) formalism considers two types of entities: variables (chemical species and regulatory sites) and influences (IRCs and ICRs). Every model entity (site, species, influence) is characterised by its attributes which can be any data concerning the biological object or interaction represented by this entity; for example:

physical attributes: size and shape for a protein, position in DNA for a genomic sequence;

localization in space (cell compartments: nucleus, cytosol);

expression pattern (cell types, tissues etc.);

observable values of the activity level for the biological object;

velocity, force, speed, amplification factor, cooperativity increase, energy of the interaction.
From the very beginning, for any bit of information added to the model, the link to the source (the set of references to papers, databases, etc.) of it should be specified. This will be important in later steps of the modeling, for example in order to estimate the data quality. We assume that all the data in the model has a representation which allows it to be compared (it may be, for instance, a textual "string" representation).
Variables
Both species and regulatory sites may represent biological objects of some abstraction level (molecules or parts of them, complex processes like regulatory pathways, complex systems like sensors, or even an entire organism). As our knowledge about biological systems is based on observations and experiments, the observable level of activity of biological objects can change in different states of the biological system. These objects can influence the levels of activity of the other biological objects. So, every species and site in MIN will be assumed to have a set of observable values, corresponding to the observable levels of activity of the corresponding biological objects.
The formal definition of a MIN variable reflects the presence of various features (attributes) in biological objects. Also, in different sources a biological object can have different names (hence the name set of a variable). Moreover, the measurement methods used to observe the activity level of this object yield a set of possible values for the variable, usually (partially) ordered.
Definition 1
A variable V is an entity characterized by a tuple (N, W, P, L) where:

N is a nonempty set of known names of the variable;

W is a partially ordered (by ≺_{ V }) set of observable values representing the activity level of the biological object associated to the variable. We shall assume that this set has at least the default value undef, unordered with respect to the other values, and two defined values, meaning that the variable is not a constant;

P is a set of attributes, having a type, a value and the boolean unique field. unique = 1 indicates that this attribute can not be present in P more than once. Otherwise, several attributes of the same type can have different values;

L is a nonempty set of links to (bibliographic) sources of the information about the variable. This set of attributes will always include the kind of the variable (which is unique and can be either "regulatory site" or "chemical species").
Chemical species
A species represents a biological object with catalytic or binding capabilities, which influence one or more regulatory sites. These influences have a chemical nature: association/dissociation reactions, electron transfers, etc. A species may have one or more influence capabilities, that will be called affinities.
An affinity is the ability of a biological object to interact with (potentially) a set of other biological objects through a particular regulatory site. Thus, an affinity may correspond to a protein domain for a protein or a surface molecule (receptor) for a cell.
Definition 2
An affinity a is a tuple (l_{ a }, P_{ a }, L_{ a }) where:

l_{ a }is a label representing the affinity name (which is indeed the label of the binding regulatory site);

P_{ a }is a set of attributes of the affinity, having a type and a value (not necessarily unique);

L_{ a }is a nonempty set of links on sources of the information about this affinity (bibliographic references).
Now we are able to formally introduce chemical species:
Definition 3
A chemical species C is a variable (N_{ C }, W_{ C }, P_{ C }, L_{ C }) whose set of attributes P_{ C }contains (Kind, "chemical species", 1) and one or more data (Affinity, a, 0), where different a's enumerate the influence abilities of the species C.
Regulatory sites
A regulatory site regulates species activity in a manner which cannot be represented by a chemical reaction, like for example by threedimensional conformation changes in a molecule or cooperativity effects. A regulatory site may represent a genome region or a protein domain that changes its state after a chemical reaction.
A regulatory site has a label which characterizes its capabilities of being influenced through affinities. If a regulatory site and an affinity of a species have the same label, it means that the interaction is possible between the biological objects corresponding to the site and the species. A regulatory site represents an "input" for a species and regulates its activity through integration of several influences on it.
Definition 4
A regulatory site R is a variable (N_{ R }, W_{ R }, P_{ R }, L_{ R }) with the attributes (Kind, "regulatory site", 1) and (Label, l_{ R }, 1) in the set P_{ R }, where l_{ R }is a label representing the site type.
Regulatory sites are graphically represented by ellipses containing the label l_{ R }inside a triangle. An example of a regulatory site is given on the Figure 2. The presented site has two different states: free (OR 1·) and regulated ((OR 1·CI)). This means that the corresponding biological object can participate in binding with another object. The label of this site is OR, so it can be influenced by a species having an affinity labeled OR, like the one represented on Figure 2.
In the MIN representation, different biological objects are associated to different entities in the model. The attributes of sites and species may have types like "position", "size", "location" etc. expressing a knowledge about these biological objects. For example, if a gene has more than one regulatory site of the same type in its regulatory region, several sites will be present in the model, having the same label but with different positions (mentioned in the attribute set); clearly, in this case, the corresponding variables will not be compatible. All these sites will influence the species corresponding to the gene. However, several species with the same name may be present in MIN, if they have attributes with different values. So, we can represent a molecule of the same protein in free or dimerised state, or the same gene at its natural location and translocated in a different place in the genome.
Influences
Biological objects, represented by species and sites in MIN, may interact and play specific roles in these interactions. For example, they can take part in a chemical reaction, one object modifying, creating or destroying another one. We assume that every interaction happens through an affinity and a regulatory site. More formally, a chemical species C_{1} having an affinity a with a label l_{ a }can influence a chemical species C_{2} if there is a regulatory site R labeled by the same label (l_{ R }= l_{ a }) which influences the species C_{2}. An influence is defined between two MIN variables as follows:
Definition 5
An influence I between variables is a tuple (V, V', P, L) where:

V is the influencing variable;

V' is the variable influenced by V;

P is the set of influence attributes, having a type and a value (not necessarily unique);

L is the set of links to sources of the information about the influence.
The influence (ICR) of a species on a regulatory site of another species represents the chemical interaction between two biological objects in which the state of the regulatory site is modified by the species through an affinity. Symmetrically, a regulatory site can influence the value of a species, through the influence (IRC) of a regulatory site on a chemical species. In this case the interaction between corresponding biological objects cannot be represented by a chemical reaction, and there is no specific affinity associated to such an influence.
Definition 6

An influence ICR of a Chemical species C_{ ICR }on a Regulatory site R_{ ICR }is an influence (C_{ ICR }, R_{ ICR }, P_{ ICR }, L_{ ICR }) with an attribute (Affinity, a_{ ICR }) ∈ P_{ ICR }which is the affinity involved in the interaction of the species C_{ ICR }and the site R_{ ICR }, hence with (Affinity, a_{ ICR }, 0) ∈ ${P}_{{C}_{ICR}}$and either${l}_{{a}_{ICR}}={l}_{{R}_{ICR}}$or a_{ ICR }= *.

An influence IRC of the regulatory site R_{ IRC }on the species C_{ IRC }is an influence (R_{ IRC }, C_{ IRC }, P_{ IRC }, L_{ IRC }) with the attribute (Kind, IRC) ∈ P_{ IRC }.
The network
After presenting the species and the regulatory sites, the influences between them, we can now give a formal definition of the MIN for the modeling of a biological system. The information about the possible connections between species of the system is already coded in the labels of the regulatory sites and affinities. We consider that the states of the model are expressed through observable values of species and sites, so that Ω_{ C }denotes the set of functions associating a value of its value set to each species of the model, Ω_{ R }is the same for the sites of the model, and Ω is the set of all possible observable states of the model. In the following, ω ∈ Ω stands for any given observable state of the system and ω(V) will stand for the value of the variable V in the state ω.
In general, in a single biological experiment (an observation), the values of only a subset of biological objects are measured. In this case, the observable values of non observed species and sites take the special value "undef" and the state of the system will be considered as "partly" defined.
In the set Ω of observable system states a subset $\mathcal{F}$ ⊂ Ω of observed system states will yield all the partly defined system states which were really observed in biological experiments and described by biologists. $\mathcal{F}$ plays the role of a databank from which the parameters of the dynamics of the system interactions could be inferred. If some of these parameters (as, for example, kinetic rates for biochemical reactions) are known (were measured in biology), they will be directly mentioned in the attributes of the corresponding influences (there will be some attribute of the kind (Kinetic _rate, 15) belonging to P_{ ICR }or P_{ IRC }, for instance).
Definition 7 (MIN)
A Modular Interaction Network $\mathcal{M}$is a tuple ($\mathcal{V},\mathcal{I}\mathcal{C}\mathcal{R},\mathcal{I}\mathcal{R}\mathcal{C},\mathcal{F},\mathcal{L}$) where:

is the set of variables of the model; it is partitioned in a set $\mathcal{C}=\left\{{C}_{i}\righti=\mathrm{1..}\left\mathcal{C}\right\}$ of chemical species and a set $\mathcal{R}=\left\{{R}_{j}\rightj=\mathrm{1..}\left\mathcal{R}\right\}$ of regulatory sites;$\mathcal{V}=\mathcal{C}\cup \mathcal{R}$

is a set of influences from chemical species to regulatory sites through an affinity of the former and there is no more than one influence between such a pair of variables through the same affinity;$\mathcal{I}\mathcal{C}\mathcal{R}\subseteq \left\{IC{R}_{ija}\righti=\mathrm{1..}\left\mathcal{C}\right,j=\mathrm{1..}\left\mathcal{R}\right,(Affinity,a,0)\in {P}_{{C}_{i}}\}$

is a set of influences from regulatory sites to chemical species and there is no more than one influence between such a pair of variables;$\mathcal{I}\mathcal{R}\mathcal{C}\subseteq \left\{IR{C}_{jk}\rightj=\mathrm{1..}\left\mathcal{R}\right,k=\mathrm{1..}\left\mathcal{C}\right\}$

⊂ Ω is a set of observed partly defined states of the biological system;$\mathcal{F}$

is a set of links to sources of the information about those observations.$\mathcal{L}$
In figures, species will be represented by boxes, affinities by triangles inside the boxes of species, regulatory sites by ellipses, influences of a species on a regulatory site by plain arcs, and influences of a regulatory site on a species by dashed arcs. A small example of an interaction network is presented in Figure 3.
The corresponding chemical species are represented by chemical species of the MIN model. The biochemical reactions of this example are represented by regulatory sites, because a reaction is possible when all the substrates are present. This reaction regulates the level of activity of a chemical species by increasing or decreasing its quantity (concentration). Each reaction has an attribute "reversible" or "not reversible". For instance, if a reaction is reversible, this means that all the species connected to this reaction can be either products or substrates of the reaction. Another attribute of the regulatory site is a kinetic rate, which is in general a function of other mensurable parameters of the system such as concentrations of species catalyzing the reaction or even non participating directly in the reaction but influencing its kinetics. For example, such species can sequestrate one or more substrates or products or catalyze intermediate reaction steps. Another natural parameter of the kinetic rate function is the temperature: biochemical reactions go faster when the temperature increases.
On each influence adjacent to the regulatory site, an attribute corresponding to the stoichiometric coefficient is indicated. It may have 3 qualitatively different values:

0, which means that the corresponding species is an enzyme, i.e., it is not consumed or produced in this reaction, even if its presence is necessary for the reaction takes place;

a numerical value, which corresponds to the number of molecules implicated in the reaction, generally one or two;

any other label, standing for a vector of coefficients saying how many molecules of each of the 20 types of aminoacids (a_{1}, a_{2},...,a_{20}) or each of the 5 types of nucleotides (n_{1}, n_{2}, n_{3}, n_{4}, n_{5}) is needed to synthesize the macromolecular product of the reaction.
For example, the stoichiometric coefficients for Nucleotides and Aminoacids in Figure 4 are labels, and each label represents the composition of the corresponding macromolecule: CI RNA or CI protein. In general, the opposite reaction of the biochemical synthesis is degradation, and it liberates the same quantities of the corresponding substrate residuals. The stoichiometric coefficients for RNA_pol or Ribosome are 0, which means that these are enzymes in the reactions of CI RNA synthesis and of CI protein synthesis. The stoichiometric coefficient for CI is 2 for the reaction of the dimerisation of CI, meaning that two molecules of CI are needed to form a dimer.
Compression of MINs
In order to simplify MIN models, it may be interesting to find the variables representing the same biological object and to combine them. So, the following definition introduces the syntactic compatibility and the union of variables.
Definition 8 (Compatibility and union of variables)
Let {V_{ i } i = 1, 2,...,k} be the set of variables of the MIN $\mathcal{M}$, with V_{ i }= (N_{ i }, W_{ i }, P_{ i }, L_{ i }). The variables in this set will be said to be compatible if they have the same names (∀V_{ i }, V_{ j }${N}_{{V}_{i}}={N}_{{V}_{j}}$), their unique attributes are compatible ((x, y, 1) ∈ P_{ i }∧ (x, z, b) ∈ P_{ j }⇒ y = z ∧ b = 1), if their partial orders are compatible (${\left({\displaystyle {\cup}_{i=1}^{k}{<}_{{V}_{i}}}\right)}^{\ast}$is acyclic) and their observed values are compatible (∀V_{ i }, V_{ j }∀(...,w_{ i },...,w_{ j },...) ∈ $\mathcal{F}$either w_{ i }= undef or w_{ j }= undef or w_{ i }= w_{ j }). In such a case, their union ${\cup}_{i=1}^{k}{V}_{i}}=\left({\displaystyle {\cup}_{i=1}^{k}{N}_{i}},{\displaystyle {\cup}_{i=1}^{k}{W}_{i}},{\displaystyle {\cup}_{i=1}^{k}{P}_{i}},{\displaystyle {\cup}_{i=1}^{k}{L}_{i}}\right)$, with ${<}_{{\displaystyle {\cup}_{i=1}^{k}{V}_{i}}}={\left({\displaystyle {\cup}_{i=1}^{k}{<}_{{V}_{i}}}\right)}^{\ast}$.
As the values of variables come from different biological experiments, in order to compare them we need to use the same approximations as generally accepted by biological science. This means that the "equality" of values w_{ i }= w_{ j }should be confirmed by a biologist when it is not obvious. Notice also that chemical species may only be compatible with other chemical species, and similarly for regulatory sites.
This definition will sometimes allow to reduce the representation of a MIN, by replacing compatible sets of variables by their union. Moreover, the translation of MIN representation in other formalism can allow further compression of variables depending on the capability of the formalism to distinguish between different biological objects.
Thus, the simplification is an operation on MIN $\mathcal{M}$ which produces MIN $\mathcal{M}$' in a following way:

First of all, the compatible variables of the MIN $\mathcal{M}$ are combined;

then, the ICRs (IRCs) of a variable V_{1} on V_{2} of the MIN $\mathcal{M}$ are linked to the variables ${{V}^{\prime}}_{1}$ and ${{V}^{\prime}}_{2}$ of $\mathcal{M}$', where ${{V}^{\prime}}_{1}$ is compatible with V_{1} and ${{V}^{\prime}}_{2}$ is compatible with V_{2};

the relation $\mathcal{F}$ is updated: the entries containing a pair of combined variables with different observed values are splitted in two entries where only one value at a time is listed for the combined variable.
The formal definition of MIN simplification is presented below.
Definition 9 (Simplification of MIN)
If $\mathcal{M}$ = ($\mathcal{V},\mathcal{I}\mathcal{C}\mathcal{R},\mathcal{I}\mathcal{R}\mathcal{C},\mathcal{F},\mathcal{L}$) is a MIN, ${\mathcal{V}}^{\prime}={\mathcal{C}}^{\prime}\cup {\mathcal{R}}^{\prime}$is a partition of $\mathcal{V}$into sets of compatible variables in $\mathcal{M}$, then the compressed form of $\mathcal{M}$through the partition $\mathcal{V}$' is the MIN ${\mathcal{M}}^{\prime}=({\mathcal{V}}^{\prime},\mathcal{I}\mathcal{C}{\mathcal{R}}^{\prime},\mathcal{I}\mathcal{R}{\mathcal{C}}^{\prime},{\mathcal{F}}^{\prime},\mathcal{L})$defined as follows:

each variable V' ∈ $\mathcal{V}$' represents the union of compatible variables composing the set V' (V' = ⋃_{V∈V'}V);

;$\mathcal{I}\mathcal{C}{\mathcal{R}}^{\prime}\stackrel{def}{=}{\displaystyle {\cup}_{{C}^{\prime}\in {\mathcal{C}}^{\prime}}{\displaystyle {\cup}_{a:(Affinity,a,0)\in {P}_{{C}^{\prime}}}IC{{R}^{\prime}}_{{C}^{\prime},a}\phantom{\rule{0.5em}{0ex}}}}where\phantom{\rule{0.5em}{0ex}}IC{{R}^{\prime}}_{{C}^{\prime},a}=\{({C}^{\prime},{R}^{\prime},{P}^{\prime},{L}^{\prime}){R}^{\prime}\in {\mathcal{R}}^{\prime},X=\{(C,R,P,L)\in \mathcal{I}\mathcal{C}\mathcal{R}C\in {C}^{\prime},R\in {R}^{\prime},(Affinity,a)\in {P}_{(C,R,P,L)}\}\ne \varnothing ,{P}^{\prime}={\displaystyle {\cup}_{ICR\in X}{P}_{ICR},{L}^{\prime}={\displaystyle {\cup}_{ICR\in X}{L}_{ICR}}\}}$

;$\mathcal{I}\mathcal{R}{\mathcal{C}}^{\prime}\stackrel{def}{=}\{({R}^{\prime},{C}^{\prime},{P}^{\prime},{L}^{\prime}){R}^{\prime}\in {\mathcal{R}}^{\prime},{C}^{\prime}\in {\mathcal{C}}^{\prime},X=\{(R,C,P,L)\in \mathcal{I}\mathcal{R}\mathcal{C}C\in {C}^{\prime},R\in {R}^{\prime}\}\ne \varnothing ,{P}^{\prime}={\displaystyle {\cup}_{IRC\in X}{P}_{IRC},{L}^{\prime}={\displaystyle {\cup}_{IRC\in X}{L}_{IRC}}\}}$

.${\mathcal{F}}^{\prime}\stackrel{def}{=}\{{\omega}^{\prime}=({{w}^{\prime}}_{1},\mathrm{...},{{w}^{\prime}}_{\left{\mathcal{V}}^{\prime}\right})\exists ({w}_{1},\mathrm{...},{w}_{\left\mathcal{V}\right})\in \mathcal{F},\forall i(\forall {V}_{j}\in {{V}^{\prime}}_{i}{{w}^{\prime}}_{i}={w}_{j}=undef\vee \exists {V}_{j}\in {{V}^{\prime}}_{i}{{w}^{\prime}}_{i}={w}_{j}\ne undef)\}$
Composition of MINs
One of the main characteristics of MINs is that they are modular and enable an incremental construction of models of biological systems. The operation of composition of two MINs includes establishing new, composed, sets of species, sites and influences. The species set of the resulting MINs is the union of species of the composing MINs, and the new sites set is the union of regulatory site sets of composing MINs. All the information about the interactions in composing systems must be also preserved. That means that a particular attention should be paid on the conversion of influences from composing MINs to the resulting one. If source MINs do not contain common species, there is no transformation to perform; the data from these MINs should be just put together.
Definition 10 (Union of MINs)
If ${\mathcal{M}}_{i}=({\mathcal{C}}_{i},{\mathcal{R}}_{i},\mathcal{I}\mathcal{C}{\mathcal{R}}_{i},\mathcal{I}\mathcal{R}{\mathcal{C}}_{i},{\mathcal{F}}_{i})$for i = 1, 2 are MINs, their union $\mathcal{M}={\mathcal{M}}_{1}\oplus {\mathcal{M}}_{2}$is the MIN such that $\mathcal{M}\stackrel{def}{=}\{{\mathcal{C}}_{1}\cup {\mathcal{C}}_{2},{\mathcal{R}}_{1}\cup {\mathcal{R}}_{2},\mathcal{I}\mathcal{C}{\mathcal{R}}_{1}\cup \mathcal{I}\mathcal{C}{\mathcal{R}}_{2},\mathcal{I}\mathcal{R}{\mathcal{C}}_{1}\cup \mathcal{I}\mathcal{R}{\mathcal{C}}_{2},{\mathcal{F}}_{1}\times {\mathcal{U}}_{2}\cup {\mathcal{U}}_{1}\times {\mathcal{F}}_{2}\}$, where $\mathcal{U}$_{ i }is the state of model $\mathcal{M}$_{ i }where all variables have the value undef.
This means that MIN models can be composed from parts that share the same species or are completely independent. This can be very useful at the first construction stages of biological regulatory networks where the data is incomplete and is not necessarily connected.
Multivalued logical formalism (MLM): basics
The goal of modeling genetic regulatory networks in the multivalued logical formalism [7] is to obtain a state graph representing the behaviour of a biological system from a qualitative point of view. This means that an observable sequence of states of a biological system is represented by a path in the state graph of the model.
The multivalued logical formalism, which has been shown very useful for genetic networks study [11, 12], is composed of a directed labeled regulatory graph and a table of dynamic parameters. The state of the regulatory graph, expressed through the labels of its vertices, can evolve according to dynamic parameters. The possible traces of this evolution can be represented in the form of a state graph. The nodes of the state graph represent the different states of the system and the arcs of the state graph represent the possible activity modifications of the biological objects.
For dynamic systems with saturation (like genetic regulatory networks) one can approximate the sigmoid curve, representing the level of the activity of a variable as a function of the level of another one, by a multivalued logical function. This approximation is called logical abstraction because it allows to distinguish between only two activity states of the system: below the threshold level and above it.
Definition 11 (Instance of a Multivalued logical model)
An instance M of an MLM of a genetic regulatory network is a pair ($\mathcal{G}$, K) where:

= (U, E) is a labeled directed graph:$\mathcal{G}$

each vertex u ∈ U is called a variable of the genetic regulatory network, and is provided with a strictly positive integer b_{ u }called the boundary of u;

each arc (u_{1}, u_{2}) ∈ E is labeled by a pair (θ, ε) where θ, called the threshold, is an integer between 1 and ${b}_{{u}_{1}}$, and ε, called the sign, belongs to {+, }. When ε = +, u_{1} is called an inducer of u_{2}. When ε = , u_{1} is called an inhibitor of u_{2}. The set of predecessors of u_{2} is denoted $\mathcal{G}$^{1}(u_{2}).

K = {K_{u,ω} u ∈ U ∧ ω ⊆ $\mathcal{G}$^{1}(u)} is a family of integers such that 0 ≤ K_{u,ω}≤ b_{ u }for any variable u and any subset ω of predecessors of u in the graph$\mathcal{G}$, called the dynamic parameters of u.
The dynamics of an MLM instance M is defined through the notion of states and transitions. A state of M is a mapping μ : U → ℕ such that, for any variable u ∈ U, 0 ≤ μ(u) ≤ b_{ u }. The value μ(u) is then called the level of the variable u. For example, an MLM instance with two variables u_{1} and u_{2} with ${b}_{{u}_{1}}={b}_{{u}_{2}}$ = 2 has 9 states corresponding to the following mappings μ_{1} = (0, 0), μ_{2} = (0, 1), μ_{3} = (0, 2),...,μ_{7} = (2, 0), μ_{8} = (2, 1), μ_{9} = (2, 2). In this case the level of variable u_{2} in state μ_{2} is μ_{2}(u_{2}) = 1.
In order to unify the treatment of different influences between variables, the definition of resources of a variable is introduced in MLM. The variable u_{1} influencing the variable u_{2} is a resource in some state if u_{1} helps the variable u_{2} in that state, meaning that u_{1} acts to increase the activity level of u_{2}.
Definition 12 (Resources of a Variable)
Given a state μ and a variable u ∈ U of a MLM M, the set of resources of u is the set ω_{ u }(μ) containing all the variables u' of M such that:

u' ∈ $\mathcal{G}$^{1}(u) is a predecessor of u in the underlying directed graph G of M;

the arc (u', u) is labeled by (θ, ε) and

if ε = "+" then μ(u') ≥ θ,

if ε = "" then μ(u') ≤ θ.
The set of variables ω_{ u }(μ) is consequently the subset of $\mathcal{G}$^{1}(u) containing both inducers of u whose expression level has reached the threshold and the inhibitors of u whose expression level has not reached the threshold.
The dynamics of the MLM reflects the dynamics of a "continuous" biological process, so the model variables cannot "skip" values: going from "1" to "3", for example, without passing by the value "2". So, the multivalued logical function is introduced to describe the evolution of a variable level in a given system state.
Definition 13 (Multivalued Logical Function)
Given a state μ and a variable u of an instance M of MLM, the multivalued logical function κ_{ u }(μ) is defined as follows:

if μ(u) <${K}_{u,{\omega}_{u}(\mu )}$then κ_{ u }(μ) = μ(u) + 1

if μ(u) = ${K}_{u,{\omega}_{u}(\mu )}$then κ_{ u }(μ) = μ(u)

if μ(u) > ${K}_{u,{\omega}_{u}(\mu )}$then κ_{ u }(μ) = μ(u)  1
The function κ_{ u }represents a "step by step" evolution of the expression level of u from its current expression level μ(u) to its dynamic parameters ${K}_{u,{\omega}_{u}(\mu )}$. The state graph of a MLM is often called asynchronous because only one variable can evolve at a time. Then, the evolution of the model can be represented as a state graph, where the system can move on a graph of system states according to its multivalued logical function.
Definition 14 ("Asynchronous" State Graph)
The state graph of a MLM M is the directed graph $\mathcal{S}\mathcal{G}$whose vertices are all the possible states of M and such that there is an edge from μ to μ' if and only if there exists a variable u satisfying:

μ'(u) = κ_{ u }(μ) ≠ μ(u) where κ_{ u }(μ) is the multivalued logical function for u;

for any variable u' ≠ u we have μ'(u') = μ(u').
An arc of the state graph from μ to μ' is usually denoted as (μ → μ') and is called a transition. This is illustrated in Figure 7(right).
Results
Translation of a MIN into an MLM
This section presents the translation algorithm of MIN into MLM formalism. It is structured in a following way. First of all, we note that multiple translations of MIN model into MLM formalism are possible, and the impact that it has on the translation algorithm. After that, the translation itself is described, starting with the construction of the MLM regulatory graph topology, then determining the dynamic parameters. At the end, this section contains an example of a translation of a small MIN network into MLM.
The obtained by translation MLM model will be called the translated network. As in many cases, the values of all parameters of the MLM model cannot be deduced precisely from the experimental data; the set of all possible parametrisations consistent with biological observations must be considered as a model which can be studied and later be refined by adding other information.
The biological information presented in MIN is much richer than that of an MLM instance, so one MIN can have multiple semantics expressed through a set of MLM instances. In other words, an MLM may be assimilated to the set of its instances. The topology of the regulatory network, as well as the boundaries, will be the same for all instances (deduced from that of MIN). However, dynamic parameters, as well as arc labels can be different since an arc of an MLM regulatory graph may correspond to several arcs of a MIN (one by affinity). As the observable values of a variable of a MIN are partially ordered (see Definition 1), the different ways of enumerating values of u (topological sort) will be considered as yielding different instances of the MLM. So, in the following, we will consider every combinations of possible parameters as one instance of MLM, and the translation procedure of MIN into MLM will give all these possible parameters that can be deduced from MIN data.
Now, let us introduce the construction of the MLM regulatory graph from the MIN model. First, the translated variables of the MLM must be defined. They are obtained from the species of the MIN, keeping only one (arbitrarily chosen) name and providing it with a boundary corresponding to the number of observable values of the MIN variable. Unless two species share a same name, due to unfortunate choices in independent sources; we shall assume it is always possible to choose those names in such a way that no two different nodes have the same name.
Definition 15 (Translated variables of a MIN)
Let C ∈ $\mathcal{V}$be a chemical species of the MIN $\mathcal{M}$, let W_{ C } be the number of different observable values of C and N ∈ N_{ C }be a name of C. The translation of C is a vertex u ∈ U labeled with N and provided with a boundary b_{ u }= W_{ C }. The species C is then called the original species of u.
The MLM regulatory graph is not complete yet, as we need to find the arc labels. These labels depend on the observed values of MIN variables. The information on the possible combinations of observed values of variables is contained in the relation $\mathcal{F}$. The same type of knowledge enables us to determine also the dynamic parameters of the MLM model. However, the influences are defined in MIN between chemical species and regulatory sites, but the MLM model encompasses the regulatory sites inside the variables representing the species, as shown in the previous definition. Thus, we need to reconstruct the parameters of influences of species on species from $\mathcal{F}$ and the MIN topology.
In order to find the arc labels of the translated regulatory graph and the corresponding dynamic parameters K, we introduce the relation Ψ_{ ik }between values of the species C_{ i }and the species C_{ k }, called interspecies regulation relation. This relation is defined if there is a site R_{ j }such that there is an ICR_{ ij }with (Affinity, a) ∈ ${P}_{IC{R}_{ij}}$ and (Affinity, a, 0) ∈ ${P}_{{C}_{i}}$ and there is an IRC_{ jk }in the MIN, i.e., the species C_{ i }regulates the species C_{ j }through the site R_{ j }. For example, on Figure 8, the species CI regulates the species CRO through the sites OR 1, OR 2 and OR 3.
In order to translate the information about the dynamics of the biological system, contained in $\mathcal{F}$, we need to define the choice operation σ, which we will call a selection, as presented in following definition. For each pair of variables V_{ i }, V_{ j }, the selection ${\sigma}_{{V}_{i},{V}_{j}}(\mathcal{F})$ returns the observed system states in which both values of variables i and j were measured.
Definition 16 (Selection of observed states for a pair of MIN variables)
The selection of observed states $\mathcal{F}$of a biological system $\mathcal{M}$for a pair of variables V_{ i }, V_{ j }is the subset ${\sigma}_{{V}_{i},{V}_{j}}\subseteq \mathcal{F}$such that $\omega \in {\sigma}_{{V}_{i},{V}_{j}}$if and only if ω(V_{ i }) and ω(V_{ j }) are both defined.
The selection will be used in the next definition in order to formally define the interspecies regulation relation Ψ_{i,k}, which links the values of species i and k which could be observed experimentally at the same time. This relation lists the values coming from $\mathcal{F}$ lines where states were observed for species i, species k and the regulatory site R, influenced by i and influencing k. That means that the interaction of species i and k is transmitted by the regulatory site R.
Definition 17 (Interspecies regulation relation)
An interspecies regulation relation ${\Psi}_{i,k}\subseteq {W}_{{C}_{i}}\times {W}_{{C}_{k}}$is a relation between values of the species C_{ i }and C_{ k }of a MIN $\mathcal{M}$, defined when the species C_{ i }regulates the species ${C}_{k}:{\Psi}_{ik}\stackrel{def}{=}\{({w}_{1},{w}_{2})({C}_{i},R,P,L)\in \mathcal{I}\mathcal{C}\mathcal{R},(R,{C}_{k},P,L)\in \mathcal{I}\mathcal{R}\mathcal{C},{\omega}_{1},{\omega}_{2}\in \mathcal{F}:{w}_{1}={\omega}_{1}({C}_{i}),{\omega}_{1}(R)={\omega}_{2}(R),{\omega}_{2}({C}_{k})={w}_{2}\}$.
Thus, the Ψ relation lists the pairs of values (w_{ i }, w_{ k }) of species C_{ i }and C_{ k }such that the value w_{ i }of the species C_{ i }and the value w_{ k }of the species C_{ k }where observed simultaneously or when the regulatory site linking them was in the same state (for an example see Figure 8).
The next definition uses the interspecies regulation relation in order to add the missing labels on the arcs of MLM regulatory graph, translated from MIN. The observed values, returned by the interspecies regulation relation, are sorted by the first value, and then the algorithm tries to fit them to a sigmoid curve, an ascendant or a descendant one. If such fitting is possible, the algorithm tries to determine the threshold for this sigmoid curve. The first fact is translated by the sign, "+" or "", in the arc label. The threshold value is also mentioned on the corresponding arc, when found.
Definition 18 (Translated regulatory graph)
If $\mathcal{M}$ = ($\mathcal{V},\mathcal{I}\mathcal{C}\mathcal{R},\mathcal{I}\mathcal{R}\mathcal{C},\mathcal{F},\mathcal{L}$) is a MIN with $\mathcal{V}=\mathcal{C}\cup \mathcal{R}$, its translated regulatory graph $\mathcal{G}$ = (U, $\mathcal{E}$) (representing a set of genetic regulatory graphs) is a directed graph where:

U is a set of translated variables of$\mathcal{M}$;

is the set of arcs (u_{1}, u_{2}) between variables of U such that:$\mathcal{E}$

(u_{1}, u_{2}) ∈ $\mathcal{E}$if u_{ i }is a translated variable of C_{ i }∈ $\mathcal{C}$, i = 1, 2 and ∃ICR ∈ $\mathcal{I}\mathcal{C}\mathcal{R}$, ∃IRC ∈ $\mathcal{I}\mathcal{R}\mathcal{C}$such that C_{ ICR }= C_{1}, R_{ ICR }= R = R_{ IRC }and C_{ IRC }= C_{2}. For each pair (ICR, IRC) satisfying these conditions we will use the notation (ICR + IRC) ∈ (u_{1}, u_{2}).

the arc (u_{1}, u_{2}) is labeled with a set of pairs (θ, ε) such that:
* if $\exists {w}_{i}\in {W}_{{C}_{i}}$, i = 1, 2, (w_{1}, w_{2}) ∈ Ψ_{1,2} such that: $\exists {{\Psi}^{\prime}}_{1,2}\subseteq {\Psi}_{1,2}:({w}_{1},{w}_{2})\in {{\Psi}^{\prime}}_{1,2}$and $\forall ({{w}^{\prime}}_{1},{{w}^{\prime}}_{2})\in {{\Psi}^{\prime}}_{1,2}$, if ${{w}^{\prime}}_{1}{\preccurlyeq}_{{\text{C}}_{\text{1}}}{w}_{1}\Rightarrow {{w}^{\prime}}_{2}{\preccurlyeq}_{{\text{C}}_{\text{2}}}{w}_{2}$and if ${w}_{1}{\preccurlyeq}_{{\text{C}}_{\text{1}}}{{w}^{\prime}}_{1}\Rightarrow {w}_{2}{\preccurlyeq}_{{\text{C}}_{\text{2}}}{{w}^{\prime}}_{2}$, then (w, +) is in the set. (In this case w = w_{1} is a threshold, and (w_{1}, w_{2}) is a positive threshold pair of MLM interaction (u_{1}, u_{2}));
* if $\exists {w}_{i}\in {W}_{{C}_{i}}$, i = 1, 2, (w_{1}, w_{2}) ∈ Ψ_{1,2} such that: $\exists {{\Psi}^{\prime}}_{1,2}\subseteq {\Psi}_{1,2}:({w}_{1},{w}_{2})\in {{\Psi}^{\prime}}_{1,2}$and $\forall ({{w}^{\prime}}_{1},{{w}^{\prime}}_{2})\in {{\Psi}^{\prime}}_{1,2}$, if ${{w}^{\prime}}_{1}{\preccurlyeq}_{{\text{C}}_{\text{1}}}{w}_{1}\Rightarrow {w}_{2}{\preccurlyeq}_{{\text{C}}_{\text{2}}}{{w}^{\prime}}_{2}$and if ${w}_{1}{\preccurlyeq}_{{\text{C}}_{\text{1}}}{{w}^{\prime}}_{1}\Rightarrow {{w}^{\prime}}_{2}{\preccurlyeq}_{{\text{C}}_{\text{2}}}{w}_{2}$, then (w, ) is in the set. (In this case w = w_{1} is a threshold, and (w_{1}, w_{2}) is a negative threshold pair of MLM interaction (u_{1}, u_{2}));
The translated regulatory graph $\mathcal{G}$ looks very much like a MLM model, but there are still some differences. It may contain several labels by arc, and these labels contains observed values, which are not necessary numerical ones. Thus, the next definition describes how to obtain a family of well formed MLM models from $\mathcal{G}$.
Definition 19 (Labeled directed graphs)
The family of labeled directed graphs compatible with the translated regulatory graph $\mathcal{G}$ = (U, $\mathcal{E}$) is the set of graphs G = (U, E) constructed in the following way:

(u, u') ∈ E iff (u, u') ∈ $\mathcal{E}$and it is labeled with at most one of pairs (θ, ε) from the set labelling (u, u') ∈ $\mathcal{E}$, if any.

For each node u of the so constructed translated regulatory graph, let us consider the set Θ_{ u }of all thresholds occuring on the arcs originating from u. The bound b_{ u }associated to u will be the Θ_{ u } + Nua, where Nua is the number of unlabeled arcs originating from u. For each topological sort (θ_{1},...,${\theta}_{{b}_{u}}$) of Θ, the numerical values 1 ≤ t ≤ b_{ u }are associated to the corresponding variable values (θ_{1},...,${\theta}_{{b}_{u}}$), and each label (θ, ε) is replaced by the corresponding (t, ε) in arc labels.

If (u, u') ∈ $\mathcal{E}$has an empty label, (u, u') ∈ E should be labeled with (t, ε) such that 1 ≤ t <b_{ u }and ε = + or .
A state μ of such a graph G ∈ $\mathcal{G}$ associates then to the node u a numerical value in {0,...,b_{ u }} identifying an interval between two successive thresholds.
The MIN representation of biological systems is richer than that of MLM, already because the last does not take into account states of regulatory sites. So, several states of the MIN may be represented by only one state of the MLM. In order to establish the connection between dynamic parameters of both systems, the correspondence between states of them must be introduced: one MLM state corresponds to a domain of states in MIN.
Notation 1 (Translation of system states of MIN in MLM)
If $\mathcal{M}$ = ($\mathcal{V},\mathcal{I}\mathcal{C}\mathcal{R},\mathcal{I}\mathcal{R}\mathcal{C},\mathcal{F},\mathcal{L}$) is a MIN, and G = (U, E) is one of the family of labeled directed graphs compatible with the translated regulatory graph of $\mathcal{M}$, μ is a state of G, $\mathcal{O}$_{ μ }is the set of states ω ∈ Ω such that ∀u ∈ U if C ∈ $\mathcal{C}$is the original species of the variable u then (μ(u) = 0 ∧ ω(C) ≼ θ_{1}) ∨ (0 <μ(u) <b_{ u }∧ θ_{μ(u)}≼ ω(C) ∧ ω(C) ≺ θ_{μ(u)+1}) ∨ (μ(u) = b_{ u }∧ ${\theta}_{{b}_{u}}$ ≼ ω(C)). μ is called the translated state of the domain $\mathcal{O}$_{ μ }, and $\mathcal{O}$_{ μ }is the set of original states of μ.
In order to obtain the MLM translation of a MIN, we still need to define the dynamic parameters K associated to the possible states of the graphs G compatible with $\mathcal{G}$. The dynamic parameters for a variable are composed of observed states found in $\mathcal{F}$ at lines determined by possible values of this variable's resources.
Definition 20 (MLM translation)
If $\mathcal{M}$ = ($\mathcal{V},\mathcal{I}\mathcal{C}\mathcal{R},\mathcal{I}\mathcal{R}\mathcal{C},\mathcal{F},\mathcal{L}$) is a MIN, its MLM translation is a family of instances M = (G, K) such that:

G is one of the family of labeled directed graphs compatible with the translated regulatory graph of$\mathcal{M}$;
K = {${K}_{u,{\omega}_{u}(\mu )}$} are the dynamic parameters of the MLM instance M where ${K}_{u,{\omega}_{u}(\mu )}$is a set of observable values that the variable u (see Definition 12), the translated variable of C_{ u }∈ $\mathcal{C}$, can have when the MIN state of the system ω is an original state of the state μ of G: if C_{ u' }∈ $\mathcal{C}$is the original variable of u' ∈ G^{1}(u), ${K}_{u,{\omega}_{u}(\mu )}\in {\displaystyle {\cup}_{{u}^{\prime}\in {G}^{1}(u)}\left({\displaystyle {\cup}_{\omega \in \mathcal{O}(\mu )}{\Psi}_{{C}_{{u}^{\prime}},{C}_{u}}\left(\omega \right)}\right)}$.
Numerical values are associated to dynamic parameters using the partial order on values of the original species or other information, preserving the order obtained after the threshold ordering.
Application to the λ phage genetic switch
Modeling the interacting entities
The chemical species of the model are associated to the chemically active molecules of the system: proteins CI and CRO, which are able to bind the regulatory sites of the λ switch. The regulatory sites named OR 1, OR 2 and OR 3 can be distinguished in the regulatory region of the λ switch. Both proteins can bind these regulatory sites. This binding capability will be represented by the affinity labeled OR. The regulatory sites will be labeled with the same label OR.
The corresponding regulatory DNA regions OR 1, OR 2 and OR 3, controlling the expression of CI and CRO, are shared by two genes: cI and cro. It means that the same regulatory site is used to control both genes, and that its state determines the activity level of both proteins simultaneously. So, the influences of CI and CRO on regulatory sites OR 1, OR 2 and OR 3, and of these sites on the proteins' activity can be added into the model.
The static information about the biological system includes the information about observable values of variables. The observable states of regulatory sites OR 1, OR 2 and OR 3 are "CI_bound, CRO_bound" or "free". Three different observable levels of activity (concentrations) of proteins can be measured: "absent", "low", "high" for CI and "absent", "present", "high" for CRO.
Dynamics of the system
The dynamic description of the biological system in MIN is expressed through the attributes of influences and in relation $\mathcal{F}$ (see Figure 8).
The "affinity of CI for OR 1 is tenfold higher than for OR 2 and OR 3" [1] can be translated in our formalism by placing the entry (CI = low; OR 1 = CI_bound, OR 2 = free, OR 3 = free) in $\mathcal{F}$.
The property of the cooperativity between interacting molecules such as "CI bound to OR 1 increases the affinity of OR 2 for another tenfold" can be represented in MIN through the refining the information about observabale states by adding the new entries {(CI = low, OR 1 = free, OR 2 = free) and (CI = low, OR 1 = CI_bound; OR 2 = CI_bound)} in $\mathcal{F}$.
The next type of information concerns the influence of regulatory sites on the protein activity level. The fact that the "Polymerase binding to the CRO promoter is disabled if CI is bound to OR 1" can be translated in our formalism by the fact that the protein CRO is absent when the OR 1 site is bound, so we add the entry (OR 1 = CI_bound; CRO = absent) in $\mathcal{F}$.
In the same way the cooperativity could be represented in the expression of CI. Its promoter is naturally weak, but it can produce important quantities of CI if the site OR 2 is occupied. This information provides two new entries for the relation $\mathcal{F}$ : (OR 2 = free, CI = low), (OR 2 = CI_bound, CI = high).
The highest binding affinity of CRO is for OR 3, so that CRO rapidly shuts off CI production by excluding the RNA polymerase from CI promoter, so, another condition for CI production is that OR 3 remains vacant. It can be represented by entries (OR 3 = CRO_bound, CI = absent) and (OR 3 = free, CI = present) in $\mathcal{F}$.
Pr, the CRO protein promoter, is inherently a strong one, so as soon as the site OR 1 is vacant, CRO protein is produced, which is represented in MIN by entries (OR 1 = CI_bound, CRO = absent), (OR 1 = CRO_bound, CRO = absent) and (OR 1 = free, CRO = high) in $\mathcal{F}$.
In order to transform the MIN representation of the λ switch in MLM we need to obtain the corresponding interaction graph and the dynamic parameters.
Translated interaction graph
The choice of variables of MLM is obvious: variables CRO and CI will represent the interacting molecular species of the MLM.
${\Psi}_{{C}_{i},{C}_{k}}$ relations calculated from the relation $\mathcal{F}$
Ψ_{CI,CI}  Ψ_{CI,CRO}  Ψ_{CRO,CI}  Ψ_{CRO,CRO} 

(absent, absent)  (absent, absent)  (absent, absent)  (absent, absent) 
(absent, low)  (absent, high)  (absent, low)  (absent, high) 
(low, absent)  (low, absent)  (absent, present)  (high, absent) 
(low, low)  (high, absent)  (absent, high)  
(low, high)  (low, absent)  
(high, absent)  (high, absent)  
(high, low)  
(high, high) 
Using the Definition 18 of the translated regulatory graph, we can obtain the subsets of ${\Psi}_{{C}_{i},{C}_{k}}$ relations in which the values of C_{ i }are fully ordered.
Fully ordered subsets for Ψ_{CI,CRO}and Ψ_{CRO,CRO}. Here and after, positive threshold pairs are shown in bold, negative threshold pairs are shown in italic
${\Psi}_{CI,CRO}^{1}$  ${\Psi}_{CI,CRO}^{2}$  ${\Psi}_{CRO,CRO}^{1}$  ${\Psi}_{CRO,CRO}^{2}$ 

(absent, absent)  (absent, high)  (absent, absent)  (absent, high) 
(low, absent)  (low, absent)  (high, absent)  (high, absent) 
(high, absent)  (high, absent) 
Thus, the corresponding arcs of the translated regulatory graph will be labeled with θ_{CI,CRO}= low, ε_{CI,CRO}= "" and θ_{CRO,CRO}= high, ε_{CRO,CRO}= "".
Four fully ordered subsets for the relation Ψ_{CRO,CI}
${\Psi}_{CRO,CI}^{1}$  ${\Psi}_{CRO,CI}^{2}$  ${\Psi}_{CRO,CI}^{3}$  ${\Psi}_{CRO,CI}^{4}$ 

(absent, absent)  (absent, present)  (absent, low)  (absent, high) 
(low, absent)  (low, absent)  (low, absent)  (low, absent) 
(high, absent)  (high, absent)  (high, absent)  (high, absent) 
Three of four cases lead to the same threshold pair, and the fourth does not have one. So, the arc (CRO, CI) of the translated regulatory graph should be labeled with θ_{CRO,CI}= low and ε_{CRO,CI}= .
For the relation Ψ_{CI,CI}18 fully ordered subsets are possible, and they are presented in Figure 9, as well as four labels of the arc (CI, CI).
Dynamic parameters for every instance of the obtained MLM can be derived from the relations Ψ according to definition of translated parameters.
Dynamic parameters for the variable CRO in the MLM translation
K _{CRO,Ø}  K _{CRO,{CI}}  K _{CRO,{CRO}}  K _{CRO,{CI,CRO}} 

Ψ_{CI,CRO}(CI = high) ∪ Ψ_{CI,CRO}(CI = low) ∪ Ψ_{CRO,CRO}(CRO = high) = {absent} {0}  Ψ_{CI,CRO}(CI = absent) ∪ Ψ_{CRO,CRO}(CRO = high) = {high, absent} {0, 2}  Ψ_{CI,CRO}(CI = high) ∪ Ψ_{CI,CRO}(CI = low) ∪ Ψ_{CRO,CRO}(CRO = absent) = {absent, high} {0, 2}  Ψ_{CI,CRO}(CI = absent) ∪ Ψ_{CRO,CRO}(CRO = absent) = {high} {2} 
Dynamic parameters for the variable CI translated from MIN to MLM. K_{CI,Ø}, K_{CI,{CI}}, K_{CI,{CRO}}, K_{CI,{CI,CRO}}
1,   1, +  2,   2, +  

K _{CI,Ø}  Ψ_{CI,CI}(CI = low) ∪ Ψ_{CI,CI}(CI = high) ∪ Ψ_{CRO,CI}(CRO = low ) ∪ Ψ_{CRO,CI}(CRO = high) = {absent, low, high} {0, 1, 2}  Ψ_{CI,CI}(CI = absent) ∪ Ψ_{CRO,CI}(CRO = low) ∪ Ψ_{CRO,CI}(CRO = high) = {absent, low} {0, 1}  Ψ_{CI,CI}(CI = high) ∪ Ψ_{CRO,CI}(CRO = low ) ∪ Ψ_{CRO,CI}(CRO = high) = {absent, low, high} {0, 1, 2}  Ψ_{CI,CI}(CI = absent) ∪ Ψ_{CI,CI}(CI = low) ∪ Ψ_{CRO,CI}(CRO = low ) ∪ Ψ_{CRO,CI}(CRO = high) = {absent, low, high} {0, 1, 2} 
K _{CI,{CI}}  Ψ_{CI,CI}(CI = absent) ∪ Ψ_{CRO,CI}(CRO = low ) ∪ Ψ_{CRO,CI}(CRO = high) = {absent, low} {0, 1}  Ψ_{CI,CI}(CI = low) ∪ Ψ_{CI,CI}(CI = high) ∪ Ψ_{CRO,CI}(CRO = low ) ∪ Ψ_{CRO,CI}(CRO = high) = {absent, low, high} {0, 1, 2}  Ψ_{CI,CI}(CI = absent) ∪ Ψ_{CI,CI}(CI = low) ∪ Ψ_{CRO,CI}(CRO = low ) ∪ Ψ_{CRO,CI}(CRO = high) = {absent, low, high} {0, 1, 2}  Ψ_{CI,CI}(CI = high) ∪ Ψ_{CRO,CI}(CRO = low ) ∪ Ψ_{CRO,CI}(CRO = high) = {absent, low, high} {0, 1, 2} 
K _{CI,{CRO}}  Ψ_{CI,CI}(CI = low) ∪ Ψ_{CI,CI}(CI = high) ∪ Ψ_{CRO,CI}(CRO = absent) = {absent, low, high} {0, 1, 2}  Ψ_{CI,CI}(CI = absent) ∪ Ψ_{CRO,CI}(CRO = absent) = {absent, low} {0, 1}  Ψ_{CI,CI}(CI = high) ∪ Ψ_{CRO,CI}(CRO = absent) = {absent, low, high} {0, 1, 2}  Ψ_{CI,CI}(CI = absent) ∪ Ψ_{CI,CI}(CI = low) ∪ Ψ_{CRO,CI}(CRO = absent) = {absent, low, high} {0, 1, 2} 
K _{CI,{CI,CRO}}  Ψ_{CI,CI}(CI = low) ∪ Ψ_{CI,CI}(CI = high) ∪ Ψ_{CRO,CI}(CRO = low) ∪ Ψ_{CRO,CI}(CRO = high) = {absent, low} {0, 1}  Ψ_{CI,CI}(CI = low) ∪ Ψ_{CI,CI}(CI = high) ∪ Ψ_{CRO,CI}(CRO = absent) = {absent, low, high} {0, 1, 2}  Ψ_{CI,CI}(CI = absent) ∪ Ψ_{CI,CI}(CI = low) ∪ Ψ_{CRO,CI}(CRO = absent) = {absent, low, high} {0, 1, 2}  Ψ_{CI,CI}(CI = high) ∪ Ψ_{CRO,CI}(CRO = absent) = {absent, low, high} {0, 1, 2} 
This example illustrates the construction of the MIN model from the biological data and shows that this model can be automatically translated in the MLM formalism. In the worst case, the interaction graph of the MLM is constructed from the MIN representation, but no constraint is found on the dynamic parameters (as for parameters ${K}_{CI,{\omega}_{\mu}}$ in networks C and D, Figure 11). In the best case, only one value for each dynamic paramter will be produced (as for K_{CI,{CRO}}).
From MIN to ODEs
An important part of the biological knowledge comes from biochemistry. It covers information about the dynamics of chemical reactions, which are treated in the in silico models through the device of ordinary differential equations (ODEs).
where k_{ i }is the reaction rate for the ith Pproduction chemical reaction, α_{ ij }is the stoichiometric coefficient of the jth substrate in this reaction, S_{ ij }is this substrate, [S_{ ij }] is the concentration of the latter, and k_{ l }, α_{ lj }, [S_{ lj }] denote the corresponding elements for the lth Pdegradation reaction and its cosubstrates.
In order to translate the MIN model in ODEs, we need to write the set of chemical reactions in the biological system, and to deduce (if possible) the reaction rates from the parameters of the influences of the MIN model. In a case where the mechanism of the reaction is unknown, it may be written in MichaelisMenten form: $S\stackrel{E}{\to}P$, where E is an enzyme catalyzing the reaction but not consumed in it. The translation of this reaction into differential equations is a known issue.
For example, in the third equation describing the production of the CI RNA from nucleotides, CI_RNA corresponds to the quantities of each of the four nucleotides composing the CI RNA: A, U, C and G (the last one, T, being absent from the RNAs). The RNA polymerase (RNA_pol in Figure 4) is the enzyme which catalyzes the CI RNA synthesis without being consumed in this reaction, so its concentration influences the reaction rate k_{ CI_RNA_synth }and it is taken into account in the function f·OR 1·CI_{2} stands for the DNA information source for the CI RNA synthesis, and it acts also as a catalyzer: without this species the CI RNA synthesis is impossible. One molecule of CI_RNA species is produced from all the necessary nucleotides on the matrix OR 1·CI_{2} and under the action of the RNA_pol. The first equation describes the concentration of the CI protein dimer CI_{2}. The right part represents the synthesis of one molecule of CI_{2} from 2 molecules of CI (first term) minus the dissociation of the CI_{2} species on 2 CI proteins (second term).
More generally, any MIN model can be translated into differential equations with an automated procedure, even if it was not explicitly constructed to represent a set of biochemical reactions. In some cases, it may be necessary to first demultiply MIN regulatory sites in order to translate the model directly as for the example in Figure 4.
While the states of a chemical species may characterize the degree of its activity, through a discrete indication like "absent", "low", "high", or through a quantitative information like the concentration, leading quite directly to a representation in ODEs, the states of a regulatory site may potentially be more difficult to interpret. In the simplest case a regulatory site represents a single chemical reaction. The regulatory sites modeling to single chemical reactions, like "CI RNA synthesis", "CI protein synthesis" or "CI dimerisation" in Figure 4, correspond to such a situation, and are easy to translate in ODEs.
However, in a more complex case, a regulatory site may encompass through its different states a family of biochemical reactions, making a direct translation difficult. Actually, the concentrations of participating species for a single chemical reaction are sufficient to find out its activity rate, thus represented by a function. For a family of reactions, the reaction rate is not always a function (but a relation) of the concentrations of each species, and this is precisely the difficulty of the translation to ODEs.
Discussion
The MIN representation proposes a rich formal description of biological interaction networks. The methodology of modelling biological systems in an incremental MIN representation is illustrated by a case study on the λ switch system. The formalisation of biological data is independent of any given modeling or simulation approach. The main goal of MIN is to contain as many different data about interacting entities as possible in order to make them accessible to any particular modeling approach. A translation into R. Thomas' formalism allows the modeler to obtain an MLM model from the available data, and the MLM is consistent with other models of the same system [11]. While the translation from MIN into MLM is rather complicated, it can be easily automated using the algorithm presented in this paper. However, without the expert intervention, the number of MLM models can be high. The modeler can act on the data put into the MIN model, changing and refining it, and this change will have an impact on the produced MLM translated models. However, there is no need for an expert to deeply understand the algorithm itself. The translation of MLM instances can be further continued into Petri nets as studied in [2] and, thus, provides an access to the available Petri net tools for analysis. Each formalism has its advantages and fits the description of a certain data type, the complete and efficient description of biological systems is possible only by combining these tools. A formalism forces an interpretation of available data in order to fit them in its framework. Some data which are incompatible with the chosen framework will inevitably be lost. Sometimes the same model represented in different formalisms can hardly be recognized [13, 1, 5, 4].
The situation where a MIN variable have a high number of observed (quantitative or qualitative) values may occur. However, this is not necessarily a problem, as the fact of having a lot of observations for the same variable means that the corresponding biological object plays an important role in the biological process being studied. In this case, every species regulated by this object through a regulatory site is supposed to generate a logical threshold of action. In addition, the fact that several quantitative values are not significantly different is the additional information, which, if available, may be encoded in the partial order for the variable values as a class of equivalence for several variable values.
The representation of regulatory sites and affinities separately from chemical species helps to represent in a "formal" way large proteins with many functional domains, or a complex set of regulatory sites in a protein or in a gene. The specificity of the λ phage genetic switch is that the promoter region of two different genes is represented by the same biological object (DNA region). This fact is represented in our formalism by having only one set of regulatory sites of the λ switch which influence two different species: CI and CRO.
MIN enables an incremental model construction through the composition of MINs and the storage (in the species affinities and regulatory site labels) of the information about possible interaction capabilities of biological entities. Thus, MIN can help in the model construction by a rational choice of new variables to be added to the model: with compatible regulatory sites or affinities.
Experimental techniques in biology collect massive amounts of information on the behavior and interaction of thousands of genes and proteins across diverse conditions. These techniques are used to question complex biological systems that use highly intricate regulatory mechanisms and control schemes. One cannot fully characterize such complex cellular systems by focusing on a single control mechanism, as measured by a single experimental technique. In MIN, the data coming from different experimental techniques are all stored in $\mathcal{F}$. To gain a deeper understanding of the system, it is pertinent to analyze heterogeneous data sources in a truly integrated fashion and to shape the analysis results into one body of knowledge [14, 15].
We proposed a new paradigm for the modeling of biological systems, in which all available experimental data are considered as a set of snapshots of the real system and stored in $\mathcal{F}$ without any interpretation. The information about the system is added and refined incrementally. The current state of knowledge in MIN can be automatically translated into a given formalism framework for the analysis of the dynamics of the system; it could also be used in the future by an inference system applying artificial intelligence techniques [16] to solve complex biological problems.
Recently, a method for representing and communicating biological networks in both human and machine readable form has been presented in [19]. The ambition of this work is obtaining a semantically and visually unambiguous diagram scheme, but this leads to a very low level representation of processes and the use of many kinds of nodes and links. Compared to this, MIN does not require an equivalent degree of details and enables to adjust the abstraction level of the model. Another approach, based on formal but not very expressive exchange formalisms, like SBML [20], attempts to standardize the expression of ODE based models of cellular systems, concentrating on chemical reactions. Obviously, existing SBML models can be wrapped in a MIN description. In the same standardisation effort more abstract and universal metamodelling approaches [21–24] tend to create a general visual language for systems biology, similar to UML. For instance, BioUML [24] provides an abstract layer to present structure of any biological system as a clustered graph. MIN should be expressed in this language to use the infrastructure based on BioUML, to access to the biological databases and to automatically generate the executable models.
Thus, the proposed new formalism, MIN, can play the role of an intermediate level between insufficiently formalized "natural language" and too specialized "mathematical descriptions" of biological systems. The MIN construction is a process of inference of the biological interaction networks from the biological observations of microscopic and macroscopic levels. Its underlying structure provides a skeleton for the understanding of "first principles" of the organisation of biological systems. A computer analysis tool to study the properties of MIN models, to perform automatically their composition and translation into different formalisms, is currently under developed and should soon become available for download. The study of the relation between the information available in MIN and the best suited model is on of the perspectives of this project.
Conclusion
Examples of representations of biological objects in MIN according to their biological function, either of a catalytic or regulatory nature
biological object  Role  Model entity 

Gene  information storage and propagation  species 
regulatory sequence of DNA  regulation of gene activity  regulatory site 
Protein  catalysis  species 
phosphorylation or cleavage site  regulation of protein activity  regulatory site 
metabolic pathway  transformation of molecules  regulatory site 
receptor on a cell surface ...  detecting environmental state ...  regulatory site ... 
Such models may be composed. The trivial case of a composition is the union of models having no common species or sites. The union of data contained in these models is the new, composed, model. In the case of models sharing common entities, the repeated nodes of the resulting network are collapsed.
MIN being an abstract formalism, its semantics is not intended to be defined directly, but rather as a translation into a target model. In this paper, we first define a translation of MIN into the Multivalued Logical modeling formalism (MLM) [7].
The multivalued logical representation of genetic regulatory networks [7] is one of the closest to the biological intuition. The major problem of this formalism is that it is not incremental, which means that updating an existing model (by adding or removing nodes or edges in the regulatory graph, for instance) leads to the situation where the set of dynamic parameters changes in an unpredictable way, as well as the dynamics of the system. In order to cope with this problem, the idea is to describe the biological system in MIN and translate it automatically, when needed, at any modeling step, into the multivalued logical formalism. This translation should preserve as many as possible of the biological properties already expressed in MIN. The dynamics of the translated MIN is then based on the information available in the attributes of its influences. The interaction graph can be obtained more or less directly from the MIN presentation of a biological regulatory network. The variables of the MLM (nodes of the graph) are obtained from the species of the MIN. The influences of MLM (edges of the graph) are obtained from pairs of (ICR, IRC) present in the MIN and having a common regulatory site. The dynamic parameters of MIN indicated as attributes of its influences will serve to constrain possible dynamic parameters in the obtained multivalued logical model.
In order to further illustrate the flexibility of the MIN approach, we have also shown how to extract the dynamics of the associated chemical reactions in terms of ordinary differential equations, either directly or through a demultiplication of the regulatory sites which may represent various different reactions.
Declarations
Acknowledgements
This work was supported by Genopole in Évry (France), VisAge1901 Association in Paris (France) and the ISI Foundation (Turin, Italy). Thanks to Sorin Solomon, David Brée and anonymous referees for numerous and very useful remarks.
Authors’ Affiliations
References
 Kuttler C, Niehren J, Blossey R: Gene regulation in the π calculus: Simulating cooperativity at the lambda switch. BioCONCUR 2004.Google Scholar
 Chaouiya C, Remy E, Thieffry D: Petri net modelling of biologycal regulatory networks. In Third International Workshop on Computational Methods in Systems Biology. Edited by: Plotkin G. University of Edinburgh; 2005.Google Scholar
 Matsuno H, Doi A, Nagasaki M, Miyano S: Hybrid Petri net representation of gene regulatory network. Pac Symp Biocomput 2000, 341–52.Google Scholar
 Heidtke KR, SchulzeKremer S: Design and implementation of a qualitative simulation model of lambda phage infection. Bioinformatics 1998, 14(1):81–91.View ArticlePubMedGoogle Scholar
 Thieffry D, Thomas R: Dynamical behaviour of biological regulatory networks – II. immunity control in bacteriophage lambda. Bull Math Biol 1995, 57(2):277–297.PubMedGoogle Scholar
 Kurata H, Matoba N, Shimizu N: CADLIVE for constructiong a largescale biochemical network based on a simulationdirected notation and its application to yeast cell cycle. Nucleic Acid Res 2003, 31: 4071–4084.PubMed CentralView ArticlePubMedGoogle Scholar
 Thomas R: Regulatory networks seen as asynchronous automata : A logical description. J Theor Biol 1991, 153: 1–23.View ArticleGoogle Scholar
 Ptashne M: A Genetic switch. Blackwell Science; 1992.Google Scholar
 Thomas R, Gathoye AM, Lambert L: A complex control circuit. Regulation of immunity in temperate bacteriophages. Eur J Biochem 1976, 71(1):211–227.View ArticlePubMedGoogle Scholar
 Eisen H, Brachet P, Pereira da Silva L, Jacob F: Regulation of repressor expression in λ . Proc Natl Acad Sci USA 1970, 66: 855–862.PubMed CentralView ArticlePubMedGoogle Scholar
 Thomas R: Regulation of gene expression in bacteriophage lambda. Curr Top Microbiol Immunol 1971, 56: 13–42.PubMedGoogle Scholar
 GuespinMichel J, Bernot G, Comet JP, Mrieau A, Richard A, Hulen C, Polack B: Epigenesis and dynamic similarity in two regulatory networks in Pseudomonas aeruginosa . Acta Biotheoretica 2004, 52(4):379–390.View ArticlePubMedGoogle Scholar
 Doi A, Matsuno H, Miyano S: Induction mechanism description of lambda phage by hybrid Petri net. Currents in Computational Molecular Biology 2000, 26–27.Google Scholar
 Cardelli L: Abstract machines of systems biology. T Comp Sys Biology 2005, 3: 145–168.Google Scholar
 Tanay A, Sharan R, Kupiec M, Shamir R: Revealing modularity and organization in the yeast molecular network by integrated analysis of highly heterogeneous genomewide data. Proc Natl Acad Sci USA 2004, 101(9):2981–2986.PubMed CentralView ArticlePubMedGoogle Scholar
 Keppens J, Shen Q: On compositional modelling. The knowledge engineering review 2001, 16: 157–200.View ArticleGoogle Scholar
 Kohn KW, Aladjem MI, Weinstein JN, Pommier Y: Molecular interaction maps of bioregulatory networks: A general rubric for systems biology. Molecular Biology of the Cell 2006, 17(1):1–13.PubMed CentralView ArticlePubMedGoogle Scholar
 Pirson I, Fortemaison N, Jacobs C, Dremier S, Dumont JE, Maenhaut C: The visual display of regulatory information and networks. Trends in Cell Biology 2000, 10(10):404–408.View ArticlePubMedGoogle Scholar
 Kitano H, Funahashi A, Matsuoka Y, Oda K: Using process diagrams for the graphical representation of biological networks. Nature Biotechnology 2005, 23(8):961–966.View ArticlePubMedGoogle Scholar
 Hucka M, Finney A, Sauro HM, Bolouri H, Doyle JC, Kitano H, Arkin AP, Bornstein BJ, Bray D, CornishBowden A, Cuellar AA, Dronov S, Gilles ED, Ginkel M, Gor V, Goryanin II, Hedley WJ, Hodgman TC, Hofmeyr JH, Hunter PJ, Juty NS, Kasberger JL, Kremling A, Kummer U, Le Novere N, Loew LM, Lucio D, Mendes P, Minch E, Mjolsness ED, Nakayama Y, Nelson MR, Nielsen PF, Sakurada T, Schaff JC, Shapiro BE, Shimizu TS, Spence HD, Stelling J, Takahashi K, Tomita M, Wagner J, Wang J: The systems biology markup language (SBML): a medium for representation and exchange of biochemical network models. Bioinformatics 2003, 19(4):524–531.View ArticlePubMedGoogle Scholar
 BeurtonAimar M, Prs S, Parisey N, Nazaret C, Mazat JP: Modeling biologic networks to use them with heterogeneous treatments. Proceedings of Ecole Thematique "Modlisation et simulation de processus biologiques dans le contexte de la gnomique – 2003 – Dieppe(France)" 2003.Google Scholar
 RouxRouquié M, Soto M: Virtualization in systems biology: Metamodels and modeling languages for semantic data integration. T Comp Sys Biology 2005, 1: 28–43.Google Scholar
 RouxRouqui M, Caritey N, Gaubert L, Le Grand B, Soto M: Metamodel and modeling language: towards an Unified Modeling Language (UML) profile for systems biology. Objectoriented Modeling in Biology and Medecine, SCI 2005 2005.Google Scholar
 Kolpakov FA: BIOUML – framework for visual modeling and simulation biological systems. Proc Int Conf Bioinf of Genome Regulation and Structure (BGRS'2002) 2002.Google Scholar
Copyright
This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.