Volume 12 Supplement 4

## Proceedings of the 6th International Conference of the Brazilian Association for Bioinformatics and Computational Biology (X-meeting 2010)

# Modeling and analysis of cell membrane systems with probabilistic model checking

- Mirlaine A Crepalde
^{1}, - Alessandra C Faria-Campos
^{1}and - Sérgio VA Campos
^{1}Email author

**12(Suppl 4)**:S14

**DOI: **10.1186/1471-2164-12-S4-S14

© Crepalde et al; licensee BioMed Central Ltd. 2011

**Published: **22 December 2011

## Abstract

### Background

Recently there has been a growing interest in the application of Probabilistic Model Checking (PMC) for the formal specification of biological systems. PMC is able to exhaustively explore all states of a stochastic model and can provide valuable insight into its behavior which are more difficult to see using only traditional methods for system analysis such as deterministic and stochastic simulation. In this work we propose a stochastic modeling for the description and analysis of sodium-potassium exchange pump. The sodium-potassium pump is a membrane transport system presents in all animal cell and capable of moving sodium and potassium ions against their concentration gradient.

### Results

We present a quantitative formal specification of the pump mechanism in the PRISM language, taking into consideration a discrete chemistry approach and the Law of Mass Action aspects. We also present an analysis of the system using quantitative properties in order to verify the pump reversibility and understand the pump behavior using trend labels for the transition rates of the pump reactions.

### Conclusions

Probabilistic model checking can be used along with other well established approaches such as simulation and differential equations to better understand pump behavior. Using PMC we can determine if specific events happen such as *the potassium outside the cell ends in all model traces*. We can also have a more detailed perspective on its behavior such as determining its reversibility and why its normal operation becomes slow over time. This knowledge can be used to direct experimental research and make it more efficient, leading to faster and more accurate scientific discoveries.

## Background

Computational modeling has been increasingly used in the field of systems biology to examine the dynamics of biological processes. Traditionally, the modeling of biochemical pathways is based on a set of non-linear ordinary differential equations (ODE) to describe the evolution of average molecular concentrations over time [1]. This approach assumes continuously varying chemical concentration and deterministic dynamics, which can be unsuitable for some classes of systems, such as those that need stochastic modeling or contain a small number of molecules for each species.

The main alternative modeling paradigm, originally proposed by Gillespie [2], focus on stochastic models. It produces counts of molecules of some chemical species, whose rates of interaction are controlled by exponential distributions. In a stochastic model, various possibilities exist for the future behavior of the system, where each possibility has a certain probability. The usual way of analyzing those models is via simulation, producing trajectories that provide us with different insights of the system. Therefore, if we want to use simulation to recover meaningful information about the behavior of the system we often need a large number of simulations runs in order to retrieve an accurate estimation.

Recently there has been considerable interest in the application of model checking [3] as a powerful tool for formally reasoning about the dynamic properties of biological systems (e.g. [4], [5], [6]). Model Checking provides a way to both formally describe and analyze a system. It is a well-established and widely-used formal method for ascertaining the correctness of real-life systems. This approach is able to explore all behaviors of a modeled system through an exhaustive and systematic exploration of all possible states of the system, and therefore can identify events and conditions that can be overlooked by simulation. Probabilistic Model Checking, or PMC, is a variant of model checking for modeling and analyzing systems that exhibit stochastic behavior as is the case for several biological systems. Similar to stochastic simulation, PMC is based on a stochastic and discrete-state modeling approach via Continuous Time Markov Chains (CTMCs). However, the output of PMC is exact, as opposed to the output of stochastic simulation which is inherently approximated, taking averages over sets of simulation runs. Moreover, given that PMC deals with all states of the system, it is possible to precisely verify if an observation (a property of interest or an event) will continue forever or rather will definitely stop.

We propose that PMC be used in addition to stochastic and deterministic simulation in order to amplify the understanding of the biological system. For example, PMC can give clues about the existence of some events that can be later checked with stochastic simulation through the recovery of traces where the specific event happens. It also can support biologists suggesting interesting but uncommon aspects that can be verified experimentally.

In this paper we will use PMC for the modeling and analysis of the sodium-potassium exchange pump (Na,K-pump) in a quantitative way. This pump is an important transport system present in all animal cell and responsible for keeping the potassium and sodium concentrations inside the cell, respectively, high and low. Low sodium concentrations and high potassium concentrations in the cell cytoplasm are essential for basic cellular functions such as excitability, secondary active transport and volume regulation. In the brain, about one-half of the Adenosine Tri-Phosphate (ATP) provided by oxidate metabolism is used to power the Na,K-pump [7].

A formal specification of this system has already been developed using the *π* — *calculus* process algebra based on the known Albers-Post model [4]. This work has also used model checking to verify some computational properties such as deadlock and bisimilarity, which is an equivalence relation between state transition systems, associating systems which behave in the same way in the sense that one system simulates the other and vice-versa. However, it does not have a quantitative description of the Na,K-pump, nor does it deal with quantitative properties about the biological system.

We will describe how the pump mechanism can be modeled using probabilistic model checking taking into consideration a discrete chemistry approach and the Law of Mass Action aspects. We also will present some significative properties about the pump reversibility that can be addressed directly with model checking, whereas with other traditional approaches, such as deterministic and stochastic simulation, they can not be easily covered. Finally, we will reason about the pump behavior in terms of trend labels for the transition rates of the pump reactions which compute if there is a greater probability that the system takes specific transitions. These trends allow us to identify, for example, why the Na,K-pump goes more slowly in the forward direction over time, justifying the long periods of time to exhibit its reversibility.

## Methods

### Sodium-potassium exchange pump

*E*

_{1}and

*E*

_{2}, with inward-facing (

*E*

_{1}) and outward-facing (

*E*

_{2}) binding sites for sodium ions (Na

^{+}) and potassium ions (K

^{+}), respectively. The intracellular and extracellular forms of Na

^{+}and K

^{+}ions are explicitly identified as , , and . P

_{i}is the inorganic phosphate group and

*f*

_{ i }and

*b*

_{ i }are the forward and reverse rate coefficients for the

*i*

^{th}step in the cycle. For example,

*f*

_{1}is the forward rate for the first step reaction . Moreover, A. B means that A and B are bound to each other noncovalently and

*E*

_{i}~ P indicates that the phospharyl group is covalently bound to

*E*

_{i}. The pump mechanism is decomposed into a set of six elementary and reversible reactions. The enzyme in its conformation

*E*

_{1}and with ATP already bound binds to three sodium ions inside the cell (step 1). This reaction stimulates ATP hydrolysis and then the release of Adenosine D—Phosphate (ADP) inside the cell, forming a phosphorylated enzyme intermediate (step 2). Extrusion of Na

^{+}ions is completed by a conformational change (

*E*

_{2}) and dissociation of the resulting complex (step 3). In this new shape, the pump has high affinity with potassium ions. Then, two potassium ions outside the cell bind to the pump enzyme and because of this reaction the enzyme is dephosphorylated (step 4). A further conformational change in which the enzyme binds ATP (step 5) is followed by the release of the two potassium ions inside the cell (step 6). Finally, the pump enzyme restores its original form that is capable of reacting with at step 1. The quantitative data associated with this mechanism, quoted from [8] and [10], can be found in Table 1, which gives us a starting point for exploring the pump behavior in a quantitative way.

Experimental data associated with the sodium-potassium pump cycle

Parameter | Value | Units |
---|---|---|

[ ] | 0.02200 | M |

[ ] | 0.14000 | M |

[ ] | 0.12700 | M |

[ ] | 0.01000 | M |

[ATP] | 0.00500 | M |

[ | 0.00495 | M |

[ | 0.00006 | M |

| 2.5 × 10 | M |

| 10 | s |

| 172 | s |

| 1.5 × 10 | M |

| 2 × 10 | M |

| 1.15 × 10 | s |

| 10 | s |

| 10 | M |

| 1.72 × 10 | M |

| 2 × 10 | M |

| 30 | s |

| 6 × 10 | M |

cell volume | 10 | l |

temperature | 310 | K |

### Probabilistic model checking

Suppose *M* is a stochastic model over a set of states *S*, *s*_{0} is a starting state, *ϕ* is a dynamic property expressed as a formula in temporal logic, and *θ* ∈ [0, 1] is a probability threshold. The Probabilistic Model Checking [5, 11] (PMC) problem is: given the 4-tuple (*M*, *s*_{0}, *ϕ*, *θ*), algorithmically decide whether *M*, *s*_{0} |= *P*_{≥θ}(*ϕ*), i.e. if the property *ϕ* is true with probability greater or equal than *θ*. In other words, probabilistic model checking requires, like non-probabilistic model checking, two key inputs: a description of the system in some high-level modeling formalism and a specification of one or more desired properties (*ϕ*) of that system in temporal logic. However, unlike non-probabilistic version, in probabilistic model checking the model is stochastic and the properties of interest are expressed in a quantitative way: for example, rather than verifying that ”does the species A eventually react with the species B?” we are interested in asking ”what is the probability that the species A eventually reacts with the species B?”. Given the stochastic description of the model, the probabilistic model checker constructs a mathematical model *M* that represents the system dynamics usually in terms of a digraph, in which each state represents a possible configuration and each transition represents an evolution of the system from one configuration to another over time. Moreover positive and real values are assigned to the transitions between states, representing rates of negative exponential distributions. This mathematical model *M* is, in fact, a *continuous-time Markov chains* (CTMCs) [5]. Formally, letting ℝ_{≥0} denote the set of non-negative reals and *AP* be a finite set of atomic propositions used to label states with properties of interest, a CTMC is a tuple (*S*,*R*,*L*) where:

• *S* is a finite set of states;

• *R* : (*S* × *S*) *→* ℝ_{≥0} is the transition rate matrix, which assigns rates to each pair of states;

• *L* : *S* → 2^{AP} is a labelling function which associates each state with a set of atomic propositions.

*s*and

*s′*being triggered within

*t*time-units is 1 –

*e*

^{–R(s,s′).t}. The time spent in state

*s*before any such transition occurs is exponentially distributed with the rate

*E*(

*s*) = ∑

_{s′∈S}

*R*(

*s*,

*s′*), called the

*exit rate*. The probability of moving to state

*s′*is given by

*R*(

*s*,

*s′*)

*/E*(

*s*). In this work we have used PRISM tool to describe and analyze our biological model. PRISM is a known probabilistic model checker that provides support for CTMC models. The properties in PRISM should be specified using the Continuos Stochastic Logic (CSL) [5], which is based on the Computational Tree Logic (CTL) and the Probabilistic Computation Tree Logic (PCTL). The syntax of CSL formulas is the following:

where *a* ranges over a set of atomic propositions, *p* ∈ [0, 1], ⊴ ∈ {>, <, ≥, ≤} and *I* is an interval of ℝ_{≥0}. There are two types of CSL properties: transient
and steady-state
. For this current work we are only interested in transient or time-dependent properties. A formula
is true in state *s* if the probability that *ϕ* is satisfied by the paths starting from state *s* meets the bound ⊴*p*. Path formulas are constructed using the **X** (next) operator and the **U**^{
I
} (time-bounded until) operator. The path formula **X** Φ is true if Φ is satisfied in the next state, whereas Φ_{1} **U**^{
I
} Φ_{2} is true if Φ_{2} is held at some time instant in the interval *I* and at all preceding time instants Φ_{1} holds. Other operators can be derived from this minimal set of CSL operators. Two of them, which will be used in this work, are the *eventually* operator **F**^{
I
} Φ, which is true if Φ is satisfied in some time instant in the interval I, and the *always* operator **G**^{
I
} Φ, which is true if Φ is satisfied in every time instant in the interval *I*. It is worth to note that the interval *I* can be omitted in the operators **U**, **F** and **G** which means that the interval is [0, ∞].

Furthermore, PRISM lets a CTMC be augmented with **rewards,** which are structures that associate real values with states or transitions. The state-rewards are accumulated in proportion to the time spent in the state, whereas the transition-rewards are accumulated each time the transition is taken. In PRISM, these are described using the

**rewards** ”*rewardname*” …**endrewards**

to describe state-rewards and transition-rewards, respectively. In the previous definition, *g* is a predicate, *a* is a label for a set of commands that represent a transition in the system and *r* is a real-valued expression, which can contain variables and constants from the model. A state-reward item assigns the real value, resulting from the evaluation of *r* expression, to all states satisfying the predicate *g* and a transition-reward item assigns the real value to all transitions labelled with *a* and from states satisfying *g*.

Given the definition of the reward items, some properties can be used to recover amounts related to them. For example, the property ”what is the expected number of reactions between species A and B before a reaction between species A and C happens?” can only be asked with the reward mechanism. Two of the property types related to rewards which will be used in this work are
and
. The former property is true, from a state *s*, if the expected state-reward at time instant *t* meets the bound ⊴*r*, whereas the later property is true, from a state *s*, if the reward accumulated along a path until a point where Φ is true meets the bound ⊴*r*. The total reward for a path in a CTMC is the sum of the state-rewards along the path plus the sum of the transition-rewards for each transition between these states. The state-reward assigned to each state of the model is interpreted as the rate at which rewards are accumulated in that state, i.e. if *t* time units are spent in a state with state-reward *r*, the accumulated reward in that state is *r* × *t*. The bounds ⊴*p* and ⊴*r* may not be specified, in which case the probability or reward is calculated in PRISM.

#### PRISM algorithm

The techniques that are implemented in PRISM to solve the PMC problem for CTMC models with rewards include *graph-theoretical algorithms* and *numerical computation*. The former operates on the underlying graph structure of a markov chain to determine, for example, the set of reachable states in a model, or to check qualitative properties. The latter is required for the calculation of probabilities and reward values. While iterative methods to solve linear equation systems are used for answering question related to the steady-state behavior of the model, i.e. its behavior in the long-run or equilibrium, uniformisation is used for transient probability computation. Moreover, PRISM uses a structure called *multi-terminal binary decision diagrams* (MTBDD) for representing compactly the graph structure of a markov chain. More details about PRISM engineering can be found in [12].

### Sodium-potassium pump specification

#### Discrete chemistry

The entities in our model are ion species (
,
,
,
), molecules (ATP, P_{i}, ADP) and the Na,K-ATPase (the pump enzyme) which can interact through six elementary reactions (see Fig. 2). In this work the amount of each representative of these species is modeled as a discrete quantity, not using a continuous function. Then, we have converted the amount of initial representatives of species from molarity (M) as shown in Table 1 to counts of molecules and ions. As some rates are also defined in terms of molarity, we have also converted them into stochastic rates
and
, which regard counts of molecules and ions.

*X*]) into counts of molecules and ions (

*#X*), we have used the following biological definition:

where *V* is the cell volume and *N*_{A} is the Avogadro constant.

where *κ* is the molecularity of the reaction. Molecularity in chemistry is the number of entities that are involved in a reaction. For example, in the simple reaction *A* + 2*B* → *AB*_{2}, the reagents are *A* and 2*B* and the *κ* value is 1 + 2 = 3. The
rates are obtained in the same way as the
rates.

#### Law of mass action

*r*

_{4}is given as follows:

Given a reagent species, we have to raise its concentration to its molecularity. The final rates for the other sodium-pump mechanism steps are obtained similarly, see [8] for details.

#### PRISM specification

We now illustrate how to specify our Na,K-pump model in the PRISM language. Part of the model is presented in *PRISM Model* code. The complete model is available in [13]. A CTMC description in PRISM language should start with the keyword **ctmc** and comprises a set of *modules*, whose states are represented by a set of finite-ranging *variables*. In our model, there is a module for each species involved in the Na,K-pump: **na**, **k**, **atp**, **adp**, **p** and the **pump** enzyme. There are also two finite-ranging variables in k module: *kIn* and *kOut* that describe, respectively, the number of potassium ions inside and outside the cell. On the other hand, there are six variables in the module **pump** and each of them represents one possible enzyme state, according with the cycle in Fig. 2.

*guarded commands*of the form []

*g*→

*r*:

*u*. The interpretation of a command is that if the predicate (guard)

*g*is true, then the system is updated according to

*u*, which comprises one or more statements of the form (

*x′*= …) indicating how the value of variable

*x*is changed. The rate at which this occurs is given by

*r*, i.e. this is the value that will be attached to the corresponding transition in the underlying CTMC. PRISM also supports

*synchronization*between modules in the style of process algebras. This is achieved by labelling commands with

*actions*(placed between the initial square brackets).

Transitions in different modules labelled with the same action occur simultaneously. The rate of synchronized transitions is equal to the product of the individual rates of the commands of the different modules that synchronize. In our model, the required updates when the fourth pump reaction (given in (3)) happens are represented by the commands labelled with action **r4**. Then, there is a decrease in the number of potassium ions outside the cell and the pump changes its state. The final rate when this reaction happens is *r* 4*rate* ∗ *E2P* ∗ *pow*(*kOut*, 2), where *r* 4*rate* denotes the
stochastic rate derived from the kinetic rates using the calculation described in Sect. *Methods - Sodium-potassium pump specification -Discrete chemistry*, *E2P* denotes the amount of pumps in *E2P* state and *pow*(*kOut*,2) ≡ *kOut*^{2}. We can extend our existing model by allowing more than one pump to occur in the system using the **NP** constant, which can assume any integer value to represent the number of pumps.

*Rewards to PRISM Model*. We have defined two rewards:

**kOut**and

**time**. The former assigns the current number of potassium ions outside the cell to every state in the system. This can be used to compute the expected amount of potassium ions outside the cell in a specific time for example. The latter simply assigns a state-reward of 1 to all states in the model and it is useful to analyze the total expected time before an event occurs.

## Results and discussion

^{–20}liters for analysis in the following sections. This type of abstraction strategy is common for modeling biological systems as discussed in [14].

Model size ranging the cell volume.

Cell Volume(l) | #States | #Transitions | Time to Build | Time to Check |
---|---|---|---|---|

10 | 9 | 16 | 0.03 sec | 2 min 45.54 sec |

10 | 32 | 62 | 0.29 sec | 51.94 sec |

10 | 194 | 386 | 47.45 sec | 4 min 45.35 sec |

10 | 1 838 | 3 674 | 1 h 48 min 29.03 sec | 1 h 2 min 18.98 sec |

10 | ? | ? | > 7 days | ? |

### Discovering rare events

Uncommon events can have a significant impact in any system and particularly in biological systems. For example, if a particular combination of reagents can cause a pump to block permanently, it can cause cell death. No matter how unlikely this event is, if it happens the consequences are critical. Traditional analysis methods such as stochastic simulations can miss uncommon or rare events, because they simulate random paths in the evolution of the system, and if the event is rare, it is not likely that it will be simulated in a viable amount of time. PMC, however, can identify these events by looking for them. By stating a property that is true if such an event occurs, PMC can identify the conditions for its occurrence, and as a consequence, uncover hidden but potentially important behaviors in the system.

*M*outside the cell over time for the ODE approach (dashed line and

*y*axis on the right), which uses a deterministic and continuous pump model. The model was built and solved in MATLAB as described in [15]. The figure also presents the count of potassium ions outside the cell given by a simulation trace (solid line and

*y*axis on the left) of the discrete and stochastic pump model. The simulation trace was obtained using the BIONETGEN tool [16], which provides an implementation of the direct method of Gillespie.

As can be seen in the ODE approach, the potassium outside the cell is decreasing until around 2 seconds, and its concentration converges on about 0.0018 M. However, this average behavior hides some important traces, as it is shown in the same figure, where the potassium count outside the cell, after the fast decrease until about 2 time units, will oscillate around 12 and might end, i.e. it can eventually reach value 0. However, the probability of this event *potassium outside the cell ends* is extremely low (6.33 × 10^{–3}) during the first 10 seconds. This probability value was determined using the CSL property *P* =? [*F* <= 10 *kOut* = 0]. Notice that there is a significant difference between a rare event and an impossible event. If the event is rare we may decide, based on its occurrence probability, to investigate it further or not. If it is an important event that may cause death it may merit further studies, whereas if it *cannot* happen, we need not worry about it. Properties such as these can help direct future researches and shorten scientific discovery times.

Thus, whereas a deterministic simulation *will* not identify this rare event *potassium outside the cell ends* because it captures only average behaviors, the stochastic simulation approach *may* not capture traces where it happens, depending on the simulation time and on the number of simulated traces.

However PMC can provide stochastic simulation with some hints in this sense. As it lets us know in advance that the rare event happens with probability equal to 6.33 × 10^{–3} in the first 10 seconds, if the stochastic simulation time being considered is 10, in a sample of 1000 traces, for example, about 6 or 7 of them will probably show the rare event.

Property (6) means *What is the expected time to the potassium outside the cell being over?*. The model checker answer was 1287 seconds. The reward structure for this property associates reward 1 with each state (see the reward structure ”time” in Sect. *Methods - Sodium-potassium pump specification - PRISM Specification*). On the other hand, property (7) asks *about the probability of potassium outside the cell eventually being over in the first 1287 seconds*, whose answer is 0.63. Thus, we can conclude that during the first 1287 seconds the potassium outside the cell ends in around 63 % of the traces of the system. In this case the expected time is very long and unlikely to be reached before another event occurs. However, the same technique can be used to model reaction time to the presence of a toxin, for example, and the expected time can be crucial to the survival of the cell.

*maximum and minimum expected time for the system to go from a state where potassium outside the cell is over to a state where this species is not more over*:

**min**and

**max**are used to return the minimum and maximum expected time to reach a state where

*kOut*> 0, ranging over all start states that satisfy

*kOut*= 0. The model checking answers for (8) and (9) properties are, respectively, 111 milliseconds and 14 milliseconds. This minimum expected time for the event duration can be used as a guideline for choosing the time step in stochastic simulation to guarantee that no such events will be lost. Another event that can be easily identified with model checking is if

*after that potassium outside the cell is ended*,

*its amount will eventually return to the initial count KO*. Property (10) is used to verify if this event happens in all traces in the model, whereas property (11) is used to determine the expected time for the event to happen:

where ”kOutOver” is a label to *kOut* = 0. The model checker result for property (10) was true and the expected time computed in property (11) is about 132, 515 seconds.

Thus, two significant events in the system *potassium outside the cell will end and the potassium outside the cell will return to its initial count* will happen in all traces of the pump model and lead us to study about their recurrence in the long term.

### Reversibility of the sodium-potassium pump

Due to the fact that there are backwards and forwards transitions for all reactions involved in the Na,K-pump mechanism, as is shown in Fig. 2, and that many of these transition rates depend on transmembrane substrates, the pump mechanism is automatically reversible, i.e the reactions can be run either forwards or in reverse direction, depending on changes in the amount of substrates. Thus, given the initial concentrations of the substrates, we can consider that the pump performs two main steps. First it runs following the forward reactions and reaches the configuration where substrates reach a maximum or minimum concentration. Then, given these changes in the amount of substrates, the pump returns to the initial configuration through the reverse reactions. Of course, it is possible that the reverse reactions can be followed during the first step, and, similarly, forward reactions can be followed during the second step. In the forward running, Na,K-pump uses one ATP to perform the electrogenic exchange of 2 potassium ions from outside to inside the cell in exchange for 3 sodium ions from inside to outside the cell. In the reverse direction ATP can be produced from ADP and P_{i}.

*KO*, and the final amount of substrates, after the forward running is complete and before the reverse running starts. In this final configuration, the potassium outside the cell ends, i.e. it reaches its minimum value (

*kOut*= 0). This pump reversibility is expressed through CSL property (12), which means

*What is the probability that kOut oscillation between 0 and KO values will never terminate?*

where *i* is *KO* and *j* is 0. The result of CSL property (12) is 1, which proves that the events *potassium outside the cell ends* and *potassium outside the cell reaches the initial amount* happen infinitely often, i.e. the automatic pump reversibility property of the pump is true. This pump property can not be seen in the Fig. 3, because the study of the average behavior of the pump overlooks some aspects of its reversibility. Moreover we are reasoning about the pump infinite behavior, which cannot be achieved through generating and analysis of finite-time trajectories with stochastic simulation. Property (12) can be used to check if the concentration of some species oscillates between any two values *i* and *j*.

### Understanding the pump cycle

In this section we present a study of the Na,K-pump mechanism in terms of the rates in the cycle shown in Fig. 2, in order to understand why the depletion of potassium outside the cell and consequently the pump reversibility can take long periods of time to be completed.

*r*(

*s*,

*s*

_{ i }) from a current state

*s*:

where *E*(*s*) is the exit rate of state *s*, i.e., *E*(*s*) = *∑*_{
s′∈S
} *r*(*s*, *s′*), being *S* a finite set of states, and *ξ* is a threshold that indicates a positive trend. We have chosen the value 0.6 for *ξ* in our analysis and, therefore, informally an ascending trend for a transition rate *r*(*s*, *s*_{
i
}) means that the probability of the system goes from *s* to *s*_{
i
} (at least 0.6) is greater than goes to any other state *s*_{
j
} (*j* ≠ *i*), whose transition rate *r*(*s*, *s*_{
j
}) > 0.

*labels*and

*formulas*). The code in

*PRISM Model Extension 2*illustrates the procedure for computing the positive trend label for the transition rate

*r*

_{1}.

*r*

_{1}is computed by the formula

**rate_r1**and it is different to 0 when the current pump state is

*E*

_{1}. ATP and there is enough sodium inside the cell . In this case, the final value for

*r*

_{1}is determined in the same way as described in Sect.

*Methods - Sodium-potassium pump specification - PRISM Specification*. The other rates are computed in similar way than

*r*

_{1}and the formula exit rate represents their summation. The probability that

*r*

_{1}is taken in the current state is given by formula

**rate_r1_d**, whereas the label

**trend_r1_up**represents if

*r*

_{1}really has an ascending trend, i.e. ↑

*r*

_{1}is 1. Now, we can use the CSL property (13) to identify the rates that never have a positive trend during the system evolution and, consequently those rates that always have an ascending trend:

In our pump model, [*r*] is used to form the trend label of the backward rates, and *i* ranges from 1 up 6, because there are six reactions in the pump system, considering each direction (forward or backward). Thus, the trend ”trend_r1” represents the trend label for the first pump reaction in the forward direction (see Fig. 2), whereas the trend ”trend_rr1” refers to the trend label for the first pump reaction in the backward direction.

*E*

_{1}.ATP) are labelled with the rates for the transition between the current state and the next state, which is given by the direction of the arrow. Associated with each arrow, there is also a sign that indicates if the transition rate has always a positive trend (+) or a negative trend (-), and, finally, if the trend can be negative and positive during the system evolution (+/-).

We can see that the forward rates *r*_{1} and *r*_{2} always have a negative trend, while *r*_{6} always has a positive trend during the system evolution. Moreover, the trends for the forward rates *r*_{3}, *r*_{4} and *r*_{5} can be positive or negative, depending on the changes in the amount of substrates during the pump evolution.

*PRISM Model Extension 3*,

**plusKout**is a reward that assigns 1 to each transition from the state K

_{2}.

*E*

_{2}to state

*E*

_{2}~ P, which results in the releasing of two potassium ions outside the cell. On the other hand

**minusKout**is a reward that assigns 1 to each transition from the state

*E*

_{2}~ P to the state K

_{2}.

*E*

_{2}, which results in the consumption of two potassium ions outside the cell. CSL property (14) determines

*the expected count of potassium outside the cell when the rate r*[

*r*]

_{ i }

*starts to have a positive trend*:

Using property (14), we can see that *r*_{3}, *r*_{4} and *r*_{5} (forward rates) start to have a negative trend only when the potassium outside the cell is, respectively, 21, 7 and 7 (the initial amount of potassium outside the cell in our model is 61).

*rr*

_{1}and

*rr*

_{6}, once

*r*

_{3}is taken, the system might complete easily the cycle in the forward direction, because the forward rates

*r*

_{3},

*r*

_{4},

*r*

_{5}and

*r*

_{6}have a positive trend in the most of the time. The backward rate

*rr*

_{2}needs that the pump goes in the forward direction awhile, increasing the amount of ADP inside the cell, in order to exhibit a positive trend. When potassium outside the cell reaches the value 21, the rates

*r*

_{3}and

*rr*

_{2}changes their trends, starting the intermediate step (B). In this step, the pump can still move in forward direction. The last step (C), starts when the potassium outside the cell reaches the value 7, causing changes in the trends of the forward rates

*r*

_{4}and

*r*

_{5}. First, rate

*r*

_{4}no longer has a positive trend, while the negative trend of the backward rate

*rr*

_{3}is replaced by a positive one. This happens due to the increase of sodium outside the cell, which gives strength to

*rr*

_{3}, and the decrease of potassium outside the cell, which weakens

*r*

_{4}. Second, the forward rate

*r*

_{5}also stops exhibiting a positive trend, whereas the trend of the backward rate

*rr*

_{4}starts to be ascending. This change is caused by the accumulation of P

_{i}inside the cell and the reduction of ATP due to the pump movement in the forward direction. In step (C) there is a low probability, although is not impossible, that the pump continues its operation in the forward direction, given that the only forward rate with positive trend is

*r*

_{6}, delaying the depletion of potassium outside the cell. In fact, there is a strong general trend for the pump to move backwards, returning to the intermediate step, where the system stays most of the time. Additionally, the pump can move backwards from the intermediate step, returning to the initial configuration. However, this takes long periods of time, given that it is necessary to move against the positive trends of the forward rates

*r*

_{3},

*r*

_{4},

*r*

_{5}and

*r*

_{6}in the initial step.

As shown in the previous sections, the depletion of potassium outside the cell and the pump reversibility are events that can happen in the pump model. However, they can take longs periods of time to be completed. So the study of this section is important to indicate the reasons for this delay. For example, it is possible to see that the first obstacle in the normal operation of the pump is the accumulation of ADP inside the cell which causes the reversion of the *r*_{3} trend. This may indicate a specific aspect of the system that merits further studies. This result may lead to a more precise study because it tells us in detail what has happened (accumulation of ADP inside the cell) and not simply that the pump has reversed its behavior. Results such as these can uncover important hidden behaviors that can speed up further experiments and increase their accuracy.

### Validation of the PRISM model

*T*, which specified in the property:

*Rewards to PRISM Model, Sect. Methods - Sodium-potassium pump specification - Prism specification*. PRISM supports

*experiments*, which is a way of automating multiple instances of model checking. In our case, this is done by ranging the constant

*T*from, for example, 0 up to 10, with steps of 0.25. The resulting graph is shown in Fig. 6 (dashed line), which is very similar to deterministic curve shown in Fig. 3. We also got a similar trajectory using the PRISM tool, Fig. 6 (solid line), which besides verification can also perform stochastic simulation of the model that mimics the Gillespie method. Thus, we can see that PRISM results for the sodium-potassium pump are very close to those obtained using the traditional approaches.

## Conclusions

In this work we use a stochastic modeling approach and *probabilistic model checker* to model and analyze the Na,K-pump which provides a new perspective on the study of the behavior of this system. It inherits many of the advantages of model checking, including the use of a formal specification of the system and the fact that the approach is exhaustive, analyzing all possible behaviors of the system.

We have presented a quantitative formal specification of the Na,K-pump, based on a set of elementary reactions. All the process to build the model in the PRISM tool, taking into account a discrete chemistry and the Law of Mass Action has been described. Moreover, we have also checked some rare quantitative properties such as the depletion of sodium potassium outside the cell and the pump reversibility that can be addressed easily using model checking, whereas with the other traditional approaches, such as simulation and ODE methodology, it can be difficult.

Furthermore, using model checking we have shown that these events happen infinitely often. These properties cannot be addressed using simulations, given that they are, by definition, time-finite approaches and, additionally, do not construct the mathematical model which represents all possible states that a system can be.

Moreover, we have used transition rate trends, in order to understand the pump behavior and why it takes a long period of time to express completely the reversibility property.

Finally, we have shown that probabilistic model checking can be used along with other well established approaches to extend the pump behavior knowledge. Then, after we know that the event *potassium outside the cell ends* happens, through model checking, we can focus the other approaches to identify and understand it better.

In practice, the main objective of this work is to provide biologists with hints related to important and interesting events that should be checked in more detail using biological experiments. Thus, biological experiments could be preceded by model checking analysis, which can be used very efficiently, for example, for rejecting impossible hypothesis or for orienting biologists toward logical possible situations. In this way, instead of performing many experiments, the biologists will focus on those that are as pointed out as possible by the mathematical model.

Future works include making our Na,K-pump model more dynamic, adding other actual cell membrane aspects and systems. In order to deal with the large state space, given the big number of ions and molecules, an abstraction of CTMCs based on discrete levels of concentrations, namely CTMC with levels [18], is already in progress.

## Declarations

### Acknowledgements

This study received financial support from CAPES, FAPEMIG and CNPQ. The authors wish to thank to PRISM team to the tool support and Jader Cruz for his assistance in the validation process of the results.

This article has been published as part of *BMC Genomics* Volume 12 Supplement 4, 2011: Proceedings of the 6th International Conference of the Brazilian Association for Bioinformatics and Computational Biology (X-meeting 2010). The full contents of the supplement are available online at http://www.biomedcentral.com/1471-2164/12?issue=S4

## Authors’ Affiliations

## References

- Wolkenhauer O, Ullah M, Kolch W, Cho KH: Modelling and Simulation of IntraCellular Dynamics: Choosing an Appropriate Framework. IEEE Transactions on NanoBioscience. 2004, 3: 200-207. 10.1109/TNB.2004.833694.PubMedView Article
- Gillespie DT: Exact Stochastic Simulation of Coupled Chemical Reactions. The Journal of Physical Chemistry. 1977, 81 (25): 2340-2361. 10.1021/j100540a008.View Article
- Clarke E, Grumberg O, Peled D: Model Checking. 1999, MIT Press
- Gabriel Ciobanu VC, Tanasa B: A
*π*-Calculus Model of the Na Pump. Genome Informatics. 2002, 13: 469-471. - Kwiatkowska M, Norman G, Parker D: Using probabilistic model checking in systems biology. ACM SIGMETRICS Performance Evaluation Review. 2008, 35 (4): 14-21. 10.1145/1364644.1364651.View Article
- Langmead C, Jha S: Predicting Protein Folding Kinetics Via Temporal Logic Model Checking. 7th International Workshop on Algorithms in Bioinformatics (WABI’07). 2007, LNCS, Springer, 4645: 252-264.View Article
- Sepúlveda FV, Bezanilla F: Pumps, Transporters and Ion Channels. 2005, Kluwer Academic/Plenum PublishersView Article
- Chapman JB, Johnson EA, Kootsey JM: Electrical and Biochemical Properties of an Enzyme Model of the Sodium Pump. Membrane Biology. 1983, 74: 139-153. 10.1007/BF01870503.PubMedView Article
- Albers RW: Biochemical aspects of active transport. Annu. Rev. Biochem. 1967, 36: 727-756. 10.1146/annurev.bi.36.070167.003455.PubMedView Article
- Hernández JA, Chifflet S: Eletrogenic Properties of the Sodium Pump in a Dynamic Model of Membrane Transport. Membrane Biology. 2000, 176: 41-52. 10.1007/s002320001074.PubMedView Article
- Jha SK, Clarke EM, Langmead CJ, Legay A, Platzer A, Zuliani P: A Bayesian Approach to Model Checking Biological Systems. CMSB ’09: Proceedings of the 7th International Conference on Computational Methods in Systems Biology. 2009, Berlin, Heidelberg: Springer-Verlag, 218-234.
- Kwiatkowska M, Norman G, Parker D: Probabilistic Symbolic Model Checking with PRISM: A Hybrid Approach. International Journal on Software Tools for Technology Transfer (STTT). 2004, 6 (2): 128-142.
- Complete PRISM model of the sodium-potassium pump. [http://www.dcc.ufmg.br/~mirlaine/models/]
- Sauro HM, Harel D, Kwiatkowska M, Shaffer CA, Uhrmacher AM, Hucka M, Mendes P, Strömback L, Tyson JJ: Challenges for modeling and simulation methods in systems biology. WSC ’06: Proceedings of the 38th conference on Winter simulation. 2006, Winter Simulation Conference, 1720-1730.
- Ullah M, Schmidt H, Cho KH, Wolkenhauer O: Deterministic modelling and stochastic simulation of biochemical pathways using MATLAB. Systems Biology. 2006, 153 (2): 53-60.PubMedView Article
- Faeder JR, Blinov ML, Hlavacek WS: Rule-based modeling of biochemical networks with BioNetGen. Methods in Molecular Biology: System Biology. 2009, Humana Press, 500: 1-55. 10.1007/978-1-59745-525-1_1.
- Andrei O, Calder M: A Model and Analysis of the AKAP Scaffold. Electronic Notes in Theoretical Computers Science. 2010
- Ciocchetta F, Degasperi A, Hillston J, Calder M: Some investigations concerning the CTMC and the ODE model derived from Bio-PEPA. Electronic Notes in Theoretical Computers Science. 2009, 145-163.

## 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.