Skip to main content

Application of Petri net based analysis techniques to signal transduction pathways



Signal transduction pathways are usually modelled using classical quantitative methods, which are based on ordinary differential equations (ODEs). However, some difficulties are inherent in this approach. On the one hand, the kinetic parameters involved are often unknown and have to be estimated. With increasing size and complexity of signal transduction pathways, the estimation of missing kinetic data is not possible. On the other hand, ODEs based models do not support any explicit insights into possible (signal-) flows within the network. Moreover, a huge amount of qualitative data is available due to high-throughput techniques. In order to get information on the systems behaviour, qualitative analysis techniques have been developed. Applications of the known qualitative analysis methods concern mainly metabolic networks. Petri net theory provides a variety of established analysis techniques, which are also applicable to signal transduction models. In this context special properties have to be considered and new dedicated techniques have to be designed.


We apply Petri net theory to model and analyse signal transduction pathways first qualitatively before continuing with quantitative analyses. This paper demonstrates how to build systematically a discrete model, which reflects provably the qualitative biological behaviour without any knowledge of kinetic parameters. The mating pheromone response pathway in Saccharomyces cerevisiae serves as case study.


We propose an approach for model validation of signal transduction pathways based on the network structure only. For this purpose, we introduce the new notion of feasible t-invariants, which represent minimal self-contained subnets being active under a given input situation. Each of these subnets stands for a signal flow in the system. We define maximal common transition sets (MCT-sets), which can be used for t-invariant examination and net decomposition into smallest biologically meaningful functional units.


The paper demonstrates how Petri net analysis techniques can promote a deeper understanding of signal transduction pathways. The new concepts of feasible t-invariants and MCT-sets have been proven to be useful for model validation and the interpretation of the biological system behaviour. Whereas MCT-sets provide a decomposition of the net into disjunctive subnets, feasible t-invariants describe subnets, which generally overlap. This work contributes to qualitative modelling and to the analysis of large biological networks by their fully automatic decomposition into biologically meaningful modules.


Signal transduction pathways are of special interest in biological and medical sciences. Many diseases are related to disturbances in signalling pathways. For example protein-tyrosine kinases (PTKs) are important regulators of intracellular signal transduction pathways, mediating development and multicellular communication in metazoans. Their activity is tightly controlled and regulated, but perturbation of the normal autoinhibitory constraints on kinase activity can result in oncogenic PTK signalling [1]. Another example are human G-protein-coupled receptors, which mediate response to light, odour, taste, hormones, and neurotransmitters. Widely prescribed drugs, such as β-adrenergic receptor blockers, antihistamines, and serotonin-reuptake inhibitors bind to specific G-protein-coupled receptors [2]. There are signalling modules, e.g., this G-protein and the mitogen-activated protein-kinase (MAPK) cascade, which occur in eukaryotic organisms from yeast to human. Budding yeast (Saccharomyces cerevisiae) has proven to be indispensable in understanding the mechanisms, interrelationships, and regulation of these components. On account of this crucial role of budding yeast we discuss our approach on the best understood signalling pathway in S. cerevisiae, the one of the mating pheromone response [3, 4].

Signal transduction pathways are usually modelled by a set of ordinary differential equations to describe the dynamic changes in the concentrations of the involved biochemical species [58]. One of the main problems in using these quantitative methods is the incomplete knowledge of kinetic parameters. Often only 30–50% of them are known, such that existing methods for parameter estimation fail. In addition, the numerical values of concentrations of species may not be considered, if they are very small, because of rounding effects in the solver algorithms. No insight into possible signal flows and the connections between species, e.g., feedback loops, are given explicitly. Moreover, more qualitative than quantitative data became available in the last years. This all has initiated the development of qualitative methods, i.e., discrete models and related evaluation techniques, which are used as a complementary intermediate step for construction and understanding of larger reliable models.

In order to model and analyse biochemical pathways on a qualitative level, dedicated methods have been developed. An example for a well established concept are the elementary modes [9], which are based on the incidence (stoichiometric) matrix of the underlying directed graph. This approach is applied for analysing metabolic networks. They are considered to be in steady state in order to use convex cone analysis techniques.

Recently, interaction graphs and Boolean networks are used to model and analyse signalling and regulatory networks [10]. [11] shows the limits of logical modelling techniques for gene regulatory networks. The authors propose an integrative systematic approach of logical and Petri net modelling discussing the tryptophan biosynthesis in E. coli. However, analyses are mentioned only in the outlook. Opposite to [12], who hold the view that the concept of elementary modes or minimal t-invariants, respectively, cannot be applied to signalling networks, [10] uses this concept, as we had already proposed in [1315] to analyse an apoptosis model.

We have based our modelling approach of signalling pathways on Petri net theory, because it comprises several analysis techniques including those, which are based on the incidence matrix. In contrast to the above mentioned techniques, Petri nets provide useful unique visualisation techniques with possibilities for hierarchical modelling and for animation. Especially this aspect is of crucial importance for experimentalists and for the dialog between experimentalists and theoreticians.

Carl Adam Petri introduced the basic concepts of Petri nets in his dissertation in the context of technical systems [16]. He developed an approach for describing and studying models, which consist of concurrent, i.e., independent, and/or causally dependent components. Since this time, many theorems and algorithms have been developed and implemented to analyse Petri net models, see, e.g., [17, 18]. First applications of Petri net theory to biological systems were published in [1921]. Meanwhile, metabolic pathways [22, 23], signal transduction pathways [14, 24], and gene-regulatory networks [25, 26] have been modelled and analysed successfully using various classes of Petri nets, qualitative as well as quantitative ones. An overview is given, e.g., in [27, 28]. For an earlier bibliography of related application papers see [29].

Signal transduction pathways exhibit some special properties. In contrast to metabolic networks, in signalling pathways there is no substance flow, but a signal flow, which is performed, for example, by phosphorylated and dephosphorylated protein forms. There are no stoichiometric reaction equations given, which dictate the net structure and define the arc weights. Modelling signalling pathways we have to work on another abstraction level than in modelling metabolic networks. Petri nets provide a generic description principle, applicable on any level of abstraction.

In this paper we present a method, which enables the systematic deduction of the net structure from the known signalling processes in the cell, which are translated into logical terms as implication, conjunction, inclusive or exclusive disjunction, and negation. These terms can be translated unambiguously to Petri net components. The resulting model is a qualitative, discrete Petri net, which can be analysed for certain system properties to validate the model.

In the following, we give a brief introduction into the mating pheromone response pathway in S. cerevisiae and recall the necessary Petri net definitions. Then, we propose and discuss in detail a systematic modelling method with respect to signalling pathways. We focus on the analysis of signal flows and introduce for this purpose the new concepts of feasible t-invariants and of maximal common transition sets (MCT-sets). Feasible t-invariants stand for minimal self-contained subnets being active under a given input situation, while MCT-sets can be interpreted as smallest biologically meaningful functional units. Both concepts define a fully automatic net decomposition into biologically meaningful modules. Whereas MCT-sets provide a decomposition of the net into disjunctive subnets, feasible t-invariants describe subnets, which generally overlap. We apply our modelling technique to the analysis of the pheromone response pathway in S. cerevisiae and discuss the results. Finally, we give conclusions indicating also further projects.

The signal transduction pathway of mating pheromone response

The signalling pathway of the mating pheromone response in S. cerevisiae is reviewed, e.g., in [3, 4, 30]. In S. cerevisiae there are two different mating types of haploid cells, MATα and MATa. Cells of opposite mating type can mate, i.e., fuse to a diploid cell. This process is stimulated through small peptide pheromones, the α-factor and the a-factor, respectively. A haploid cell secretes the own factor and carries receptors for detecting a cell of opposite mating type via the other factor. When a yeast cell is stimulated by pheromone, secreted by a nearby cell of the opposite mating type, it starts a complex signalling pathway to undergo a series of physiological changes in preparation for mating. These changes are controlled and regulated through the pheromone signalling pathway, which is nearly the same in MATα and MATa cells.

In the following, we refer to this pathway in MATa cells, so the considered cells have an α-factor-specific cell surface receptor STE2, which is coupled to a heterotrimeric G-protein. This G-protein consists of the three subunits Gα, Gβ, and Gγ, whereby the latter two can act as heterodimer Gβγ. A conformation change of the receptor catalyses an exchange of GDP to GTP in the Gα subunit leading to a dissociation of this monomer. If GTP is hydrolysed to GDP, the monomer reassociates with the dimer to the trimeric form of the G-protein [30]. The G-protein Gβγ subunits mediate a signal on the MAP kinase cascade by interacting with Cdc24 (Far1 transmitted), protein kinase Ste20, and scaffold protein Ste5. The Ste20, Ste11, and Ste7 kinases, which are activated serially, phosphorylate and activate itself the two MAP kinases Fus3 and Kss1. But, Fus3 attenuates the activation of Kss1 [31]. Fus3PP releases the transcription factor Ste12 of its suppression through Dig1 and Dig2 proteins. (Re-)Forming such a repression complex necessitates inactive Fus3 or inactive Kss1 [32]. Pheromone induced genes prepare the mating of the two cells and the fusion of their nuclei. They are responsible for cell cycle arrest in the phase G1, and the synthesis of some signalling regulators, e.g., the protease Bar1, the regulator of G-Protein Sst2, and the phosphatase Msg5. Other regulations of the signalling pathway are realised through receptor endocytosis [33] or degradation of involved kinases [34].

Petri nets

Let us first recall some basic definitions of Petri nets. More formal definitions are given, e.g., in [17, 18, 35]. Petri nets are bipartite directed multi-graphs, i.e., they consist of two types of nodes, called places P = {p1,..., p n } and transitions T = {t1,..., t m }, and directed arcs, which are weighted by natural numbers and connect only nodes of different type. Places model typically passive system elements as conditions, states, or biological species, i.e., chemical compounds as proteins. Transitions stand generally for active system elements as events, or chemical reactions as de-/activation. In graphical representations, places are depicted as circles and transitions as rectangles. Transitions without preplaces (postplaces) are called input (output) transitions and are drawn as flat rectangles. The arcs in the net describe the causal relation between active and passive elements. They are illustrated as arrows and labelled with their weight, if it is larger than one. Arcs connect an event with its preconditions, which must be fulfilled to trigger this event, and with its postconditions, which will be fulfilled, when the event takes place.

The fulfilment of a condition is realised via tokens residing in places. Principally, a place in a discrete net may carry any integer number of tokens, indicating different degrees of fulfilment. If all preplaces of a transition are marked sufficiently (corresponding to the arc weights) with tokens, this transition may fire. If a transition fires, tokens are removed from all its preplaces and added to all its postplaces, each corresponding to the given arc weights. Thus, the tokens are the dynamic elements of the system. If a condition must be fulfilled, but the firing of an adjacent transition does not remove any tokens from it, these nodes are connected via two converse arcs. In the following, these arcs are represented by bidirectional arrows as a short-hand notation and are called read arcs.

From a biological viewpoint, the tokens residing in places indicate whether the corresponding chemical species is present, i.e., its concentration is above a certain concentration level (threshold) in the cell. This presence enables the chemical reactions modelled by the place's posttransitions to take place.

A current distribution of the tokens over all places, usually given as m 0 n MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaatuuDJXwAK1uy0HMmaeHbfv3ySLgzG0uy0HgiuD3BaGabaiab=vrionaaDaaaleaacqaIWaamaeaacqWGUbGBaaaaaa@39D7@ , describes a certain system state and is called a marking of the net. Accordingly, the initial marking m0 of a net describes the system state before any transition has fired.

The incidence matrix C of a given Petri net is an (n × m)-matrix (where n denotes the number of places and m the number of transitions, compare above). Every matrix entry c ij gives the token change on the place p i by the firing of the transition t j . Thus, the incidence matrix does not reflect read arcs. A t-invariant is defined as a non-zero vector x 0 m MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaatuuDJXwAK1uy0HMmaeHbfv3ySLgzG0uy0HgiuD3BaGabaiab=vrionaaDaaaleaacqaIWaamaeaacqWGTbqBaaaaaa@39D5@ , which holds the equation

C·x = 0.     (1)

A t-invariant represents a multiset of transitions, which have altogether a zero effect on the marking, i.e., if all of them have fired the required number of times, a given marking is reproduced. The invariant property holds for an arbitrary initial marking. A t-invariant is called realisable, if a marking is reachable, such that all transitions of the t-invariant are able to fire in a suitable partial order. Analogously, a p-invariant is defined as a non-zero vector y 0 n MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaatuuDJXwAK1uy0HMmaeHbfv3ySLgzG0uy0HgiuD3BaGabaiab=vrionaaDaaaleaacqaIWaamaeaacqWGUbGBaaaaaa@39D7@ , which holds the equation

y·C = 0.     (2)

A p-invariant characterises a token conservation rule for a set of places, over which the weighted sum of tokens is constant independently from any firing, i.e., for a p-invariant y and any markings m i , m j 0 n MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaatuuDJXwAK1uy0HMmaeHbfv3ySLgzG0uy0HgiuD3BaGabaiab=vrionaaDaaaleaacqaIWaamaeaacqWGUbGBaaaaaa@39D7@ , which are reachable from m0 by the firing of transitions, it holds

y·m i = y·m j .     (3)

The nodes corresponding to the non-zero entries of an invariant x are called the support of x, written as supp(x). Considering Equations (1) and (2), it is obvious that a sum of t-invariants (p-invariants) gives again a t-invariant (p-invariant). An invariant x is called minimal, if its support does not contain the support of any other invariant z, i.e.,

invariant z : supp(z) supp(x),     (4)

and the greatest common divisor of all non-zero entries of x is one.

A net is covered by t-invariants (p-invariants), if every transition (place) participates in a t-invariant (p-invariant). A t-invariant (p-invariant) defines a connected subnet, consisting of its support, the support's pre- and postplaces (pre- and posttransitions), and all arcs in between.



First, we want to define general network components in the language of Petri nets. Considering substructures, which model logical terms as a Petri net, an ordinary implication is a trivial case. Figure 1 pictures two subnets representing conjunction-coupled implications, i.e., A (B C) and (D E) F, respectively. If there is a token on place A, the precondition A is fulfilled, and the corresponding posttransition may fire. This event will fulfil the postconditions B and C getting each a token. This example illustrates that the number of tokens in a net is not generally conserved. The fulfilment of condition F in Figure 1 depends on both preconditions D and E.

Figure 1

Two conjunction subnets. Two subnets representing conjunction-coupled implications, i.e., A (B C) and (D E) F, respectively. If there is a token on place A, the precondition A is fulfilled, and the corresponding posttransition may fire. This event will fulfil the postconditions B and C getting each a token. If there is a token on the places D and E, the preconditions D and E are fulfilled, and the corresponding posttransition may fire. This event will fulfil the postcondition F getting a token.

Figure 2 depicts two subnets representing disjunction-coupled implications, i.e., G (H I) and (J K) L, respectively. The two posttransitions of place G are in conflict, i.e., if there is one token on place G, both its posttransitions may fire, but only one of them can actually fire. This subnet represents an exclusive disjunction. Therefore, a nondeterministic behaviour results. In contrast to that, the pretransitions of place L are concurrent and can fire independently from each other, if any. With this subnet an inclusive disjunction is represented.

Figure 2

Two disjunction subnets. Two subnets representing disjunction-coupled implications, i.e., G (H I) and (J K) L, respectively. While the subnet on the left hand side stands for an exclusive disjunction, the right-hand subnet represents an inclusive disjunction. The two posttransitions of place G are in conflict, i.e., if there is one token on place G, both its posttransitions may fire, but only one of them can actually fire. This subnet represents an exclusive disjunction. In contrast to that, the pretransitions of place L are concurrent and can fire independently from each other, if one token is in each of the places J and K. With this subnet an inclusive disjunction is represented.

In all implications, presented in Figure 1 and Figure 2, the tokens in the preplaces are removed by the firing of their posttransitions. Thus, the precondition is no longer fulfilled when the connected event took place. The situation, where the state of a precondition fulfilment is preserved, is discussed below in a general form, see case 1.

A crucial point in signal transduction pathways are modifications of certain proteins, resulting in a functionally active or inactive form of these proteins. Many of them are activated by phosphorylation and deactivated by dephosphorylation, and act in different ways depending on their current state. A qualitative model allows by its structure to distinguish between different states of one protein. Modelling this situation, we use a subnet, which includes the different modifications (states) of one protein as places forming a p-invariant. A p-invariant y, which holds |supp (y)| = 2 may stand for a subnet, representing a negation by two places (A and ¬A), see Figure 3. The essential states are represented by the places p 1 (A) and p 2 (¬A) forming the p-invariant, i.e., the token depicted on place p 1 circulates only between p 1 and p 2 by firing of t 1 and t 2, respectively. To preserve this invariant structure, the adjacent transitions t 3 and t 4, respectively, are connected via read arcs.

Figure 3

A Petri net example. A Petri net, whose places p 1 and p 2 form a p-invariant, representing for example a logical negation. p 1 can be a condition A and p 2 a condition ¬A, or vice versa, indicating two states of the system, for example an activated or deactivated protein. The place p 1 carries one token to indicate in which state the system is. Transitions t 3 and t 4 are connected to this p-invariant by read arcs in order to hold the token on those places, which form the p-invariant.

Altogether, there are three cases in signal transduction models, which can be distinguished by their different use of read arcs:

  • Case 1: A substance A does not lose its activity by interacting with a second substance B, see Figure 4.

Figure 4

Case 1 using read arcs. Case 1 of using read arcs is represented. Precondition (substance) A does not lose its fulfilment (activity) by triggering the fulfilment (activation) of a condition (substance) B.

  • Case 2: A substance C triggers several events represented by transitions, which are independent of each other, see Figure 5.

Figure 5

Case 2 using read arcs. Case 2 of using read arcs is represented. Precondition (substance) C triggers several events represented by transitions, which are concurrent, i.e., independent from each other.

  • Case 3: The above mentioned context of a p-invariant, see Figure 3.

The subnet presented in Figure 5 differs from the subnet on the left hand side of Figure 2 by the use of read arcs. In Figure 2 the two posttransitions of place G are in conflict. Thus this subnet represents an exclusive disjunction G (H I). By applying read arcs in such a substructure, the posttransitions of the corresponding place are concurrent, i.e., independent from each other. Thus, the subnet in Figure 5 represents an inclusive disjunction C (D E).

Before turning to the next step, the model validation, let us summarise the main steps of the systematic model development:

  1. 1.

    compilation of biological knowledge about the signalling pathway of interest, e.g., from the literature or by database search,

  2. 2.

    translation of the interactions of relevant biological species into basic logical terms,

  3. 3.

    transferring these logical terms into net components,

  4. 4.

    assembling these net components to one Petri net,

  5. 5.

    if necessary, include input and output transitions ensuring that there are no places without pre- or posttransitions in the net.

The last but one point ensures that the developed Petri net is connected. The input and output transitions introduced in the last point make the net to a transition-bordered one. They represent the interface of the biological system to its surroundings.

Model validation

The input transitions of a transition-bordered Petri net cause unboundedness, i.e., there is no upper bound for the number of tokens in such a net. Therefore, the state space of the net, i.e., all reachable markings, is infinite, and the dynamic net properties cannot be decided by the computation of the reachability graph, which contains all reachable markings as nodes. But, we do get information about the model dynamics via the analysis of the net structure, represented by the incidence matrix. Thus, our approach to validate the model is mainly based on the net invariants. The definition of invariants, see Equations (1) and (2), was introduced in [36]. The application of a system's minimal t-invariants to analyse metabolic networks in the steady state was proposed in [9] by the definition of elementary modes. In the context of metabolic networks p-invariants are used to model substrate conservations, see, e.g., [23, 37]. However, in order to apply these techniques, which have been proven to be useful in the context of metabolic networks, to signal transduction networks, we have to adjust them first to our special needs.

P-invariants in signal transduction models represent also some kind of conservation relationship, however in the sense of the several modifications of a given species as introduced in Figure 3. A species cannot be consumed or produced, it can change its current state only, and it has to be always in exactly one state. The first step of model validation aims at checking the minimal p-invariants for their biological plausibility. Since the weighted sum of tokens over a p-invariant is constant (see Equation 3), there have to be always some tokens residing in at least one place of each minimal p-invariant ensuring that this part of the net may contribute to the system behaviour. Moreover, because a given species can always be in one state only, each p-invariant gets just one token, here. These tokens are typically placed in the p-invariants in such a way that the initial marking of the net represents an inactive state of the biological system.

The next step is to consider all possible signal flows through the network represented by realisable t-invariants, and to check their biological meaning. All possible t-invariants can be computed as non-negative linear combination of the minimal ones, see Equation (1). In former case studies, which do not contain the special p-invariant construct, see Figure 3, it was sufficient to discuss the minimal t-invariants, which are always realisable by construction [14]. Including p-invariants, we have to process the minimal t-invariants to get realisable ones, defining minimal self-contained subnets, which are active under a given input situation. For this purpose, we introduce the concept of feasible t-invariants.

Feasible t-invariants

The calculation of t-invariants does not take into account the initial marking. Moreover, read arcs are not reflected in the incidence matrix. Therefore, the question arises, whether a minimal t-invariant is really realisable. We assume that read arcs are the only source for non-realisability, i.e., there is a sufficient token number in each of the minimal p-invariants in the initial marking.

The use of read arcs corresponding to the first case described above is discussed in [15]. For an analysis, these read arcs are replaced by unidirectional ones in the direction of the main token (signal) flow. The same rationale holds true for the replacement of the read arcs corresponding to the second case. But those ones, which are connected with (see the third case), have to remain in the net in order to keep the token-preserving structure of the p-invariant. As mentioned above, read arcs are not reflected in the incidence matrix. Therefore, depending on a given marking, some of the minimal t-invariants may not be realisable considering them in a net with read arcs. For example, the p-invariant-adjacent transitions t 3 and t 4 in Figure 3 are treated as apparent input transitions, because their connection with the places p 1 and p 2, respectively, is not reflected in the incidence matrix. If this kind of transitions is part of a t-invariant, whereby their preplaces (connected via read arcs) carry no tokens, they are actually not able to fire. Therefore, the minimal t-invariants have to be processed to get realisable t-invariants for a suitable marking.

In accordance with our objective of model validation, we are looking for minimal self-contained t-invariants, which are realisable in the initial marking, i.e., minimal multisets of transitions, which can fire in an appropriate order without the firing of the other transitions, not belonging to that t-invariant. Those t-invariants are called feasible t-invariants. To make a t-invariant feasible, all of its involved transitions have to be able to fire, i.e., for each of them it is true either that it is an input transition or that its preplaces enable it to fire. The latter case means that either the considered preplaces carry already sufficient tokens in the initial marking or these preplaces get sufficient tokens via the firing of other transitions involved in this t-invariant. We distinguish between realisable and feasible t-invariants, because the notion of realisability of a t-invariant is a general term of Petri net theory, referring to the reachability of a marking, where the t-invariant's transitions can fire. Feasible t-invariants are special realisable t-invariants, which are minimal ones concerning their realisability in the initial marking. They are introduced because of a special net structure, which causes the interruption of the t-invariant, when it leads for example to a p-invariant, which carries a special marking.

Table 1 lists all feasible t-invariants of the net in Figure 3, consisting of all minimal t-invariants and one additional processed one. The processing of minimal t-invariants looks for minimal (non-negative) linear combinations, resulting into feasible t-invariants z. Let us formulate this processing of the minimal t-invariants in a general form. For each read arc between a transition t j and an empty place p i of a p-invariant the following procedure has to be applied. Let t1,...,t k be all the pretransitions of p i , which are not connected via a read arc with p i , see Figure 6. If there are no tokens residing in p i in the initial marking, a t-invariant is not realisable if it includes t j and excludes t l l {1,..., k}. The following combinations z of feasible t-invariants x and one non-feasible t-invariant y reestablish the given read arc between transition t j and place p i

Table 1 The t-invariants of the example in Figure 3.
Figure 6

A subnet representing the feasibility of minimal t-invariants. The feasibility of minimal t-invariants is represented to illustrate Equation (5). Place p i belongs to a p-invariant. It is adjacent to the pretransitions t1, t2,...t k and connected to the transition t j by a read arc. X and Y stand for the sets of t-invariants including the pre- and the posttransitions, respectively, which are contained in the corresponding dashed rectangles. Since p i does not carry tokens, t-invariants are not feasible if they contain transition t j without containing at least one of the transitions t1, t2,...t k . Thus, the read arc has to be bridged as described in Equation (5) to get feasible t-invariants.

z = x + y x l {1,...,k} : x l ≠ 0

with x j = 0

and y j ≠ 0 l {l,...,k} : y l = 0.     (5)

Note that for each feasible minimal t-invariant x providing a token on the place p i one linear combination z is constructed. Appropriate combinations have to be performed iteratively, if there occur several read arcs in the net, which have to be bridged. The combined t-invariants do not hold the criterion to be minimal, see Equation (4). But, since only inevitable combinations of minimal t-invariants are constructed, see the restrictions in Equation (5), the resulting combined t-invariants are minimal with respect to their realisability in the initial marking. Moreover, they only have non-negative entries, because they are build as a sum of two t-invariants, which are defined as vectors in 0 m MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaatuuDJXwAK1uy0HMmaeHbfv3ySLgzG0uy0HgiuD3BaGabaiab=vrionaaDaaaleaacqaIWaamaeaacqWGTbqBaaaaaa@39D5@ , see Equation (1).

Feasible t-invariants define, similarly to the t-invariants, connected subnets, characterised by its support. Generally, these subnets overlap. They represent minimal self-contained subnets being active under a given input situation. So, each of these subnets stands for a possible signal flow in the net. The examination of the feasible (minimal or combined) t-invariants for their biological plausibility is a central step of model validation. It has to be checked, whether each feasible t-invariant has a biological meaning and whether every modelled part of the considered signalling pathway is reflected in a corresponding feasible t-invariant [14].

Finally, it has to be checked, whether the net is covered by t-invariants. This property ensures that every transition participates in a t-invariant, i.e., every biological atomic action in the model may take place as part of the basic behaviour of the net.

While minimal t-invariants are computed based on the net structure only, feasible t-invariants are constructed with respect to the marking of the net. Summarising the discussion above, the following situations are possible: the minimal t-invariants can reach (1) from input to output transitions, (2) from input transitions to minimal p-invariants, (3) from minimal p-invariants to minimal p-invariants, or (4) from minimal to output transitions. The transitions of a t-invariant influence a minimal p-invariant in such a way that altogether its initial state is reproduced. Not every possible combination is considered to bridge a read arc and to connect minimal t-invariants. Such a procedure would lead to t-invariants reaching from input transitions to output transitions, only. As described above, those minimal t-invariants are combined, which meet at a minimal p-invariant with a corresponding place not carrying a token.

Maximal common transition sets (MCT-sets)

In order to support the check of feasible t-invariants for their biological meaning, the transitions are grouped into so-called maximal common transition sets (MCT-sets) by their occurrence in the minimal t-invariants: i, j {1,...,m} the transitions t i and t j are grouped into the same MCT-set, if and only if they participate in exactly the same minimal t-invariants, i.e., all t-invariants x hold

χ{0}(x i ) = χ{0}(x j ),     (6)

whereas χ{0} denotes the characteristic function, binary indicating if an argument is equal to zero. This support-oriented grouping leads to maximal sets of transitions, where each set of transitions ϑ holds

x X : ϑ supp(x) ϑsupp(x) = , (7)

whereas X denotes the set of all minimal t-invariants x.

The grouping according to Equation (6) represents an equivalence relation in T, the set of transitions, which leads to a partition of T. The equivalence classes ϑ are the MCT-sets. Transitions, not contained in any t-invariant, form their own MCT-set. MCT-sets define subnets, but not necessarily connected ones. An example of a disconnected MCT-set will be given below in the presented model.

The resulting MCT-sets are disjunctive and represent a possible decomposition of large biochemical networks into rather small subnets, which can be read as functional units. Because of the way, in which they are generated, each of the MCT-sets may represent a signalling unit or a building block with its own biological meaning. In the following, only those MCT-sets are considered, which contain more than one transition.

Results and discussion

Derivation of the Petri net model

In accordance with the elucidation above we developed a Petri net, modelling the signal transduction pathway of the mating pheromone response in S. cerevisiae. The Petri net in Figure 7 presents – to the best of our knowledge – for the first time a qualitative model of the pheromone pathway, and it extends the ODE model given in [6]. The net consists of 42 places and 48 transitions, which are listed by their name and biological meaning in Tables 3 and 4, respectively.

Figure 7

The Petri net model of the mating pheromone response pathway of S. cerevisiae. The Petri net, modelling the signal transduction pathway of the mating pheromone response in S. cerevisiae. The meaning of the places is listed in Table 3 and of the transitions in Table 4. The logical nodes are coloured in grey. A logical node is identified by its name and exists in multiple copies in the net, which are logically identical. This construct is mainly used to avoid immoderate arc crossings. The transitions, which are contained in the seven MCT-sets of Table 5, are coloured differently.

Table 3 The places of the model.
Table 4 The transitions of the model.

Proteins, protein complexes, and other chemical compounds are represented as places, and complex formation/cleavage, protein de-/phosphorylation, and other reactions by transitions. Tables 3 and 4 show in their right column, which chemical compounds and which biological events are considered in the model. Generally formulated, the model contains a complete pheromone response pathway, i.e., activation and composition of the pheromone receptor complex, composition of the MAP kinase cascade complex and MAP kinase cascade, transcription factor activation, and transcription of genes, which response to the mating pheromone. Moreover, there are several positive and negative feedback regulations included in the model, i.e., regulation of the ligand α-factor (via Bar1), of the receptor Ste2 (endocytosis induced by Yck1 and Yck2), of G-protein subunits (via Sst2), of the MAPK cascade (via labelling for degradation), and of the regulation of transcription (via repression of the transcription factor Ste12).

We take into account the above mentioned substructures, e.g., the place complex2 (p 17) does not lose its activity by firing of transition Ste11_phos_Ste7 (t 18), i.e., in the MAPK-complex the protein Ste11 remains in its active form after activating the protein Ste7, see case 1. The place Fus3PP (p 20) triggers several transitions Ste12_inhibit_phos t 22), Ste12_phos (t 24), Far1-phos (t 31), and Sst2_phos (t 34), which are independent of each other, see case 2. The place pair Kss1_phos (p 38) and unphos_Kss1 (p 39) forms a p-invariant as discussed in case 3.

With one exception, there exist only arcs weighted by 1 because no substance flow with stoichiometric relations takes place, but signal flow is described by the model. This special arc is weighted by 2 to reduce the token number in the structural cycle, which is formed by the places complex3 (p 18), complex4 (p 19), compl_without_Fus3 (p 21), and the transitions Ste7_phos_Fus3 (t 19), Fus3PP-release (t 20), and binding_free_Fus3 (t 21). By using this arc weight, it is ensured that the activation of the transition Ste7_phos_Fus3 (t 19) depends on firing of transition Ste11_phos_Ste7 (t 18), see Figure 7. In the biological context, this means that the crucial phosphorylation of the last kinases in the MAPK cascade depends on the activation of the last but one.

In the initial marking there is one token residing in the place inact_Far1 (p 31) and Sst2_in_nucleus (p 34), respectively, which symbolise that these proteins are already present in the cell in low concentration independently of a signal.

Application of Petri net concepts

P-invariant analysis

There are three minimal p-invariants in the net. Table 2 contains these p-invariants as well as the corresponding biological meaning of them. P-invariants 1 and 2, respectively, stand for the modification of the dimeric and monomeric, respectively, subunits of the receptor coupled G-protein, which occur either in the trimeric form represented in the place trimer_bound_to_receptor (p 5) or which is dissociated in its subunits G_beta_gamma_dimer (p 7) and G_alpha_GTP (p 6). Therefore, both of these p-invariants include the place p 5 in addition to one of the places p 6 and p 7, respectively. The places Kss1_phos (p 38) and unphos_Kss1 (p 39) indicate the modification of the involved kinase Kss1 and form the third minimal p-invariant according to case 3. Thus, all these minimal p-invariants can be interpreted in a biologically reasonable meaning.

Table 2 The minimal p-invariants and their biological meaning.

In the initial marking of the net there are some tokens already residing in special places. According to the elucidation in section Model validation, the places trimer_bound_to_receptor (p 5) and unphos_Kss1 (p 39) carry tokens ensuring that the minimal p-invariants contribute to the system behaviour.

T-invariant analysis

For our model we got ten minimal t-invariants covering all transitions. As mentioned above, the transitions are grouped into MCT-sets, if and only if they participate in exactly the same minimal t-invariants, see Equation (6). If a huge number of t-invariants arises for a network, the concept of MCT-sets provides additional structure information. Due to their definition, MCT-sets represent sets of events, which occur only together. These sets, together with their pre- and postplaces and all arcs in between, should symbolise signalling functional units of the model with an own biological meaning, see Table 5. For example, MCT-set 1 consists of the transitions MATalpha_cell(surrounding) (t 1), receptor_synthesis (t 3), binding_factor_to_receptor (t 2), and receptor_conformation_change (t 4). Therewith, this MCT-set represents the synthesis of Ste2, its binding to the present α-factor and its resulting conformation change. In Figure 7 the MCT-sets, which contain more than one transition, are shown in different colours. As mentioned above, the MCT-sets are not necessarily connected subnets. MCT-set 5 gives an example for a disconnected one because it contains techn_input (t 44,), compare Table 5 and Figure 7.

Table 5 The maximal common transition sets.

The necessarily in the net remaining read arcs endanger the feasibility, i.e., the realisability in the initial marking, of the minimal t-invariants. Following our modelling approach, minimal t-invariants are not feasible, if they involve a transition, which is connected via a read arc with an empty preplace, which does not get tokens by firing of other transitions involved in this t-invariant. To ensure the feasibility of all t-invariants, these non-feasible ones are joint with some others, which provide tokens on the critical preplaces. The read arcs adjacent to the place G_beta_gamma_dimer (p 7) remain in the net because of the minimal p-invariant 1. Therefore, the minimal t-invariants 3, 4, 5, and 6 do not fulfil the feasibility criterion, because they contain the MCT-set 3, but do not contain any transitions, which provide tokens at place p 7, which is connected with the MCT-set 3 via read arcs. These non-feasible t-invariants have to be processed in the way explained above, see Equation (5). Only the minimal t-invariant 1 involves transition division (in_alpha_subunit:GDP→GTP) (t 5), which provides tokens on place p 7 and does not involve the MCT-set 3. Therefore, each of the four non-feasible t-invariants is combined with t-invariant 1. These combinations provide four feasible, non-minimal t-invariants. Table 6 lists the feasible t-invariants and indicates if they are still minimal, i.e., non-processed.

Table 6 The t-invariants.

We want to discuss the biological plausibility of the feasible t-invariants. Table 7 contains the biological meaning of the t-invariants in Table 6. They all include the receptor synthesis and the binding of the pheromone factor of a MATα cell in the surroundings, causing a receptor conformation change (MCT-set 1). In t-invariant 1 the activated receptor causes the dissociation of the G-protein (transition t 5), whose subunits reassociate to a trimeric form (transition t 6). In the t-invariant 2 the proteins Yck1 and Yck2 are bound through Akr1 to the plasma membrane and phosphorylate the activated receptor. This leads to a receptor endocytosis (MCT-set 7) via an ubiquitination. The t-invariants 7 to 14 include a signal transduction via the G-protein (transition t 5) and the MAP kinase cascade (MCT-set 3). A release and phosphorylation of the transcription factor Ste12 (MCT-set 4) is involved in the t-invariants 7 to 10. This leads in these t-invariants to a transcription of the pheromone response genes preparing the cell for mating, including a feedback via Bar1 and Sst2 (MCT-set 5). Far1 is transported out of the nucleus (MCT-set 2) in t-invariants 8 and 10, while it initiates the cell cycle arrest (transition t 32) in the t-invariants 7 and 9. By containing MCT-set 6, the t-invariants 9 and 10 include a Ste12 repression via activated Fus3. In t-invariants 7 and 8, kinase Kss1 is activated and deactivated (transitions t 40 and t 42, respectively). This p-invariant 3 contributes also to the processes described in t-invariant 14, where Kss1 is phosphorylated and dephosphorylated (through transitions t 40 and t 41, respectively). Generally, the t-invariants 11 to 14 represent signalling pathways, which do not lead to a mating of the cell. All these t-invariants consist only of the receptor activation (MCT-set 1) and the MAP kinase cascade (MCT-set 3). Only t-invariant 13 involves an additional activation of Ste12 (MCT-set 4), which is repressed via Kss1 (transition t 43). The t-invariants 11 and 12 include a feedback inhibition via a protein degradation (transition t 38), which is initiated through a phosphorylation of these proteins (transitions t 37 and t 39, respectively).

Table 7 The biological meaning of the feasible t-invariants.

Recapitulating, t-invariants 7 to 10 lead to a mating of the cell, while the other t-invariants enable the cell to regulate, and modulate a pheromone induced signal by attenuated response or response desensitisation.

Altogether it can be summarised that the known signalling processes are represented in the feasible t-invariants.

Theoretical knockout experiments

The Petri net model can serve as basis of theoretical knockout experiments. They can be constructed by deleting the corresponding place and adjacent transitions, modelling the absence of this compound in a null mutant. Animating the resulting net shows already where some token accumulations arise under the new situation. These affected compounds can characterise a null mutant. Theoretical knockout experiments by the Petri net model could point out, which compounds indicate a mutant and nominate possible indicators for biological exploration.

Furthermore, a deletion of transitions leads to a deletion of feasible t-invariants, at least in a net, which is covered by t-invariants. The remaining feasible t-invariants show, which events still take place in this new cell type. For example, it is known [30] that Ste5 null mutant cells are unable to mate or to arrest the cell cycle. This experiment can be reconstructed in our Petri net model by deleting the place Ste5(scaffold) (p 11) and its adjacent transitions binding_to_Ste5 (t 12) and Ste5_binds_Ste11 (t 13). This results in the deletion of the MCT-set 3, see Table 5. The feasible t-invariants 7 to 14 do not exist in the new mutant net because they include MCT-set 3, compare Table 6. The transitions cell_fusion (t 28) (i.e., MCT-set 5), and celI_cycle_arrest_in_G1 (t 32) occur only in the feasible t-invariants 7 to 10, which were deleted. Thus, the Ste5 mutant cells modelled by that mutant net are neither able to arrest the cell cycle nor to undergo a cell fusion, because the corresponding transitions do not occur in the feasible t-invariants of the net.


In this paper we describe a systematic approach to model and analyse signal transduction pathways using qualitative Petri nets. We propose a step-wise model development via the translation of the biological interactions into logical terms, which then in turn are transferred into net components.

We explain the model validation step with a strong focus on the invariant analysis. In our modelling approach, we use minimal p-invariants, e.g., for the representation of the switching behaviour representing a compound in its activated and deactivated form. These p-invariants are embedded into the whole network by read arcs. Therefore, minimal t-invariants have generally to be processed to get feasible t-invariants. According to the construction principle, feasible t-invariants correspond to minimal self-contained subnets active under a given input situation. So, feasible t-invariants have to be checked for their biological meaning.

Furthermore, we define maximal common transition sets, which provide a decomposition of the net into not necessarily connected subnets. These structures can be interpreted as the smallest biologically meaningful functional units or building blocks of a given network.

The new concepts of feasible t-invariants and MCT-sets have been proven to be useful for model validation and the interpretation of the biological system behaviour by their fully automatic approach to decompose a given network into biologically meaningful modules. Please note that it is possible to build the MCT-sets based on the feasible t-invariants instead of the minimal ones. That makes sense in Petri nets, which contain more substructures of minimal p-invariants. MCT-sets provide a decomposition of the net into disjunctive subnets, and feasible t-invariants describe subnets, which can overlap.

We illustrate this approach using the mating pheromone pathway in S. cerevisiae. The validated model denotes the known signal flows through the net, which are obtained by the invariant analysis. We are able to assign a reasonable biological meaning to all feasible t-invariants. These reflect correctly the signal transduction in such a system, i.e., the signal response behaviour. Thus, Petri net theory is also useful to model and analyse signalling pathways considering not a substance flow, but a flow of information (signals) through the net.

The Petri net model may serve as basis for theoretical knockout experiments. By deleting appointed places and adjacent transitions, null mutants can be modelled. The analysis results of the original net can be easily modified to get some information about the derived mutant cell.

Having once validated the structure of the qualitative discrete Petri net, several applications and extensions are possible. The net may be refined and extended to a quantitative one by including known or estimated kinetic parameters (e.g., as concentrations, reaction rates, equilibrium constants), using continuous or hybrid Petri nets, respectively [38, 39].

In this way, the resulting quantitative Petri net preserves the structure of the underlying net topology. Continuous Petri nets may be considered as a structured ODEs description. They can be evaluated by standard differential equation solvers. For a related case study see [40]. Hybrid Petri net comprise generally discrete as well as continuous parts. Their evaluation requires dedicated simulation approaches. For a related case study see [24]. In both cases, the quantitative simulation will allow the observation of signal flows, already revealed by the underlying discrete model. However, contrary to our qualitative approach, where signal flows are represented explicitly by the computed feasible t-invariants, signal flows in the quantitative model are given only implicitly by the simulation results.

In this paper, we have chosen deliberately a rather small running example to be able to present all steps of the analysis procedure in full detail, which should help the reader to mimic the approach using his/her own case studies. It would be worth applying our approach to larger networks as presented in [41, 42].

Software tools and supplementary material

The development of the net has been done using the graphical Petri net editor and animator Snoopy [43] described in [44]. The analyses have been performed using the Integrated Net Analyzer INA [45]. Both tools are freely available. They are running under Windows as well as under Unix/Linux. We provide the Petri net model and the INA analysis result file in the supplementary material [46].


  1. 1.

    Blume-Jensen P, Hunter T: Oncogenic kinase signalling. Nature 2001, 355–365. 10.1038/35077225

    Google Scholar 

  2. 2.

    Wang Y, Dohlman HG: Pheromone signaling mechanisms in yeast: a prototypical sex machine. Science 2004, 306(5701):1508–1509. 10.1126/science.1104568

    CAS  Article  PubMed  Google Scholar 

  3. 3.

    Bardwell L: A walk-through of the yeast mating pheromone response pathway. Peptides 2004, 26(2):339–350. 10.1016/j.peptides.2004.10.002

    Article  Google Scholar 

  4. 4.

    Gustin MC, Albertyn J, Alexander M, Davenport K: MAP kinase pathways in the yeast Saccharomyces cerevisiae. Microbiol Mol Biol Rev 1998, 62(4):1264–1300.

    PubMed Central  CAS  PubMed  Google Scholar 

  5. 5.

    Ciliberto A, Novak B, Tyson JJ: Mathematical model of the morphogenesis checkpoint in budding yeast. J Cell Biol 2003, 163(6):1243–1254. 10.1083/jcb.200306139

    PubMed Central  CAS  Article  PubMed  Google Scholar 

  6. 6.

    Kofahl B, Klipp E: Modelling the dynamics of the yeast pheromone pathway. Yeast 2004, 21(10):831–850. 10.1002/yea.1122

    CAS  Article  PubMed  Google Scholar 

  7. 7.

    Qu Z, Weiss JN, MacLellan WR: Coordination of cell growth and cell division: a mathematical modeling study. J Cell Sci 2004, 117(18):4199–4207. 10.1242/jcs.01294

    CAS  Article  PubMed  Google Scholar 

  8. 8.

    Yi TM, Kitano H, Simon MI: A quantitative characterization of the yeast heterotrimeric G protein cycle. Proc Natl Acad Sci 2003, 100(19):10764–10769. 10.1073/pnas.1834247100

    PubMed Central  CAS  Article  PubMed  Google Scholar 

  9. 9.

    Schuster S, Hilgetag C, Schuster R: Determining elementary modes of functioning in biochemical reaction networks at steady state. Proc Second Gauss Symposium 1993, 1996: 101–114.

    Google Scholar 

  10. 10.

    Klamt S, Saez-Rodriguez J, Lindquist JA, Simeoni L, D GE: A methodology for the structural and functional analysis of signaling and regulatory networks. BMC Bioinformatics 2006., 7(56):

    Google Scholar 

  11. 11.

    Simao E, Remy E, Thieffry D, Chaouiya C: Qualitative modelling of regulated metabolic pathways: application to the tryptophan biosynthesis in E. Coli. Bioinformatics 2005, 21(Suppl 2):ii 190-ii 196.

    CAS  Article  Google Scholar 

  12. 12.

    Zevedei-Oancea I, Schuster S: A theoretical framework for detecting signal transfer routes in signalling networks. Computers and Chemical Engineering 2005, 29: 597–617. 10.1016/j.compchemeng.2004.08.026

    CAS  Article  Google Scholar 

  13. 13.

    Heiner M, Koch I, Will J: Model validation of biological pathways using Petri nets – demonstrated for apoptosis. Proc First Int Workshop on Computational Methods in Systems Biology, (CMSB 2003) Rovereto, LCNS 2602 2003, 173.

    Google Scholar 

  14. 14.

    Heiner M, Koch I, Will J: Model validation of biological pathways using Petri nets – demonstrated for apoptosis. Biosystems 2004, 75(1–3):15–28. 10.1016/j.biosystems.2004.03.003

    Article  PubMed  Google Scholar 

  15. 15.

    Heiner M, Koch I: Petri net based model validation in systems biology. Proceedings of the 25th International Conference on Applications and Theory of Petri Nets, Bologna, LCNS 3099 2004, 216–237.

    Google Scholar 

  16. 16.

    Petri CA: Communication with automata (in German). Institut für instrumentelle Mathematik, Bonn: Schriften des IIM Nr. 3; 1962.

    Google Scholar 

  17. 17.

    Murata T: Petri nets: Properties, analysis and applications. Proceedings of the IEEE 1989, 541–580. 10.1109/5.24143

    Google Scholar 

  18. 18.

    Starke PH: Analysis of Petri net models (in German). Stuttgart: Teubner Verlag; 1990.

    Google Scholar 

  19. 19.

    Reddy VN, Mavrovouniotis ML, Liebman MN: Petri net representation in metabolic pathways. Proc Int Conf Intell Syst Mol Biol 1993, 328–336.

    Google Scholar 

  20. 20.

    Hofestädt R: A Petri net application of metabolic processes. Journal of Systems Analysis, Modelling and Simulation 1994, 16: 113–122.

    Google Scholar 

  21. 21.

    Reddy VN, Liebman MN, Mavrovouniotis ML: Qualitative analysis of biochemical reaction systems. Comput Biol Med 1996, 26(2):9–24. 10.1016/0010-4825(95)00042-9

    CAS  Article  PubMed  Google Scholar 

  22. 22.

    Koch I, Junker BH, Heiner M: Application of Petri net theory for modelling and validation of the sucrose breakdown pathway in the potato tuber. Bioinformatics 2005, 21(7):1219–1226. 10.1093/bioinformatics/bti145

    CAS  Article  PubMed  Google Scholar 

  23. 23.

    Voss K, Heiner M, Koch I: Steady state analysis of metabolic pathways using Petri nets. In Silico Biol 2003, 3(3):367–387.

    CAS  PubMed  Google Scholar 

  24. 24.

    Matsuno H, Tanaka Y, Aoshima H, Doi A, Matsui M, Miyano S: Biopathways representation and simulation on hybrid functional Petri net. In Silico Biol 2003, 3(3):389–404.

    CAS  PubMed  Google Scholar 

  25. 25.

    Chen M, Hofestädt R: A medical bioinformatics approach for metabolic disorders: Biomedical data prediction, modeling, and systematic analysis. J Biomed Inform 2005.

    Google Scholar 

  26. 26.

    Doi A, Fujita S, Matsuno H, Nagasaki M, Miyano S: Constructing biological pathway models with hybrid functional Petri nets. In Silico Biol 2004, 4(23):271–291.

    CAS  PubMed  Google Scholar 

  27. 27.

    Hardy S, Robillard PN: Modelling and simulation of molecular biology systems using Petri nets: modelling goals of various approaches. J Bioinform Comput Biol 2004, 2(4):595–613. 10.1142/S0219720004000764

    CAS  Article  PubMed  Google Scholar 

  28. 28.

    Pinney JW, Westhead DR, McConkey GA: Petri net representations in systems biology. Biochem Soc Trans 2003, 31(6):1513–1515.

    CAS  Article  PubMed  Google Scholar 

  29. 29.

    Will J, Heiner M: Petri Nets in biology, chemistry, and medicine – bibliography. In Computer Science Reports 04/2002. Brandenburg University of Technology at Cottbus; 2002.

    Google Scholar 

  30. 30.

    Dohlman HG, Thorner JW: Regulation of G protein-initiated signal transduction in yeast: paradigms and principles. Annu Rev Biochem 2001, 70: 703–754. 10.1146/annurev.biochem.70.1.703

    CAS  Article  PubMed  Google Scholar 

  31. 31.

    Elion EA, Qi M, Chen W: Signal transduction. Signaling specificity in yeast. Science 2005, 307(5710):687–688. 10.1126/science.1109500

    CAS  Article  PubMed  Google Scholar 

  32. 32.

    Bardwell L, Cook JG, Voora D, Baggott DM, Martinez AR, Thorner J: Repression of yeast Ste12 transcription factor by direct binding of unphosphorylated Kss1 MAPK and its regulation by the Ste7 MEK. Genes Dev 1998, 12(18):2887–2898.

    PubMed Central  CAS  Article  PubMed  Google Scholar 

  33. 33.

    Hicke L, Zanolari B, Riezman H: Cytoplasmic tail phosphorylation of the alpha-factor receptor is required for its ubiquitination and internalization. J Cell Biol 1998, 141(2):349–358. 10.1083/jcb.141.2.349

    PubMed Central  CAS  Article  PubMed  Google Scholar 

  34. 34.

    Esch RK, Errede B: Pheromone induction promotes Ste11 degradation through a MAPK feedback and ubiquitin-dependent mechanism. Proc Natl Acad Sci 2002, 99(14):9160–9165. 10.1073/pnas.142034399

    PubMed Central  CAS  Article  PubMed  Google Scholar 

  35. 35.

    Baumgarten B: Petri nets basics and applications (in German). Heidelberg, Berlin, Oxford: Spektrum Akademischer Verlag; 1996.

    Google Scholar 

  36. 36.

    Lautenbach K: Exact liveness conditions of a Petri Net class (in German). Bonn: GMD Report 82; 1973.

    Google Scholar 

  37. 37.

    Zevedei-Oancea I, Schuster S: Topological analysis of metabolic networks based on Petri net theory. In Silico Biol 2003, 3(3):323–345.

    CAS  PubMed  Google Scholar 

  38. 38.

    David R, Alla H: Discrete, continuous, and hybrid Petri nets. Berlin: Springer Verlag; 2005.

    Google Scholar 

  39. 39.

    Lonitz K: Hybrid systems modelling in engineering and life sciences. Master's Thesis, Universität Koblenz-Landau; 2005.

    Google Scholar 

  40. 40.

    Gilbert D, Heiner M: From Petri nets to differential equations – an integrative approach for biochemical network analysis. Proceedings of the 27th International Conference on Applications and Theory of Petri Nets, Turku, LCNS 4024 2006, 181–200.

    Google Scholar 

  41. 41.

    Schoeberl B, Eichler-Jonsson C, Gilles ED, Muller G: Computational modeling of the dynamics of the MAP kinase cascade activated by surface and internalized EGF receptors. Nat Biotechnol 2002, 20(4):370–375. 10.1038/nbt0402-370

    Article  PubMed  Google Scholar 

  42. 42.

    Oda K, Matsuoka Y, Funahashi A, Kitano H: A comprehensive pathway map of epidermal growth factor receptor signaling. Mol Syst Biol 2005., 1:

    Google Scholar 

  43. 43.

    Snoopy – Petri net editor and animator[]

  44. 44.

    Fieber M: Design and implementation of a generic and adaptive tool for graph manipulation (in German). Master's Thesis, Brandenburg University of Technology at Cottbus; 2004.

    Google Scholar 

  45. 45.

    INA – The Integrated Net Analyzer[]

  46. 46.

    Supplementary material[]

Download references


This work has been partly supported by the Federal German Ministry of Education and Research (BMBF), BCB project 0312705D. We would like to thank Bente Kofahl, Edda Klipp, and Günter Czichowski for the fruitful discussions.

Author information



Corresponding author

Correspondence to Ina Koch.

Additional information

Authors' contributions

The paper is a product of a strong co-operation between all three authors. The key concepts and case study has been elaborated by AS during the work on her diploma thesis. MH gave substantial and valuable contributions in the application of Petri net techniques. IK defined the topic and gave substantial contributions to the conceptional design of the research project. The editorial work has been done by all three authors. All authors read and approved the final manuscript.

Authors’ original submitted files for images

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Sackmann, A., Heiner, M. & Koch, I. Application of Petri net based analysis techniques to signal transduction pathways. BMC Bioinformatics 7, 482 (2006).

Download citation


  • Metabolic Network
  • Incidence Matrix
  • Biological Meaning
  • Opposite Mating Type
  • Adjacent Transition