3,682 research outputs found
Membrane Systems and Time Petri Nets
We investigate the relationship of time Petri nets and di erent variants of
membrane systems. First we show that the added feature of \time" in time Petri nets
makes it possible to simulate the maximal parallel rule application of membrane systems
without introducing maximal parallelism to the Petri net semantics, then we de ne local
time P systems and explore how time Petri nets and the computations of local time P
systems can be related
Membrane Systems with Priority, Dissolution, Promoters and Inhibitors and Time Petri Nets
We continue the investigations on exploring the connection between membrane
systems and time Petri nets already commenced in [4] by extending membrane
systems with promoters/inhibitors, membrane dissolution and priority for rules compared
to the simple symbol-object membrane system. By constructing the simulating
Petri net, we retain one of the main characteristics of the Petri net model, namely, the
firings of the transitions can take place in any order: we do not impose any additional
stipulation on the transition sequences in order to obtain a Petri net model equivalent to
the general Turing machine. Instead, we substantially exploit the gain in computational
strength obtained by the introduction of the timing feature for Petri nets
Qualitative modelling and analysis of regulations in multi-cellular systems using Petri nets and topological collections
In this paper, we aim at modelling and analyzing the regulation processes in
multi-cellular biological systems, in particular tissues.
The modelling framework is based on interconnected logical regulatory
networks a la Rene Thomas equipped with information about their spatial
relationships. The semantics of such models is expressed through colored Petri
nets to implement regulation rules, combined with topological collections to
implement the spatial information.
Some constraints are put on the the representation of spatial information in
order to preserve the possibility of an enumerative and exhaustive state space
exploration.
This paper presents the modelling framework, its semantics, as well as a
prototype implementation that allowed preliminary experimentation on some
applications.Comment: In Proceedings MeCBIC 2010, arXiv:1011.005
Process Calculi Abstractions for Biology
Several approaches have been proposed to model biological systems by means of the formal techniques and tools available in computer science. To mention just a few of them, some representations are inspired by Petri Nets theory, and some other by stochastic processes. A most recent approach consists in interpreting the living entities as terms of process calculi where the behavior of the represented systems can be inferred by applying syntax-driven rules. A comprehensive picture of the state of the art of the process calculi approach to biological modeling is still missing. This paper goes in the direction of providing such a picture by presenting a comparative survey of the process calculi that have been used and proposed to describe the behavior of living entities. This is the preliminary version of a paper that was published in Algorithmic Bioprocesses. The original publication is available at http://www.springer.com/computer/foundations/book/978-3-540-88868-
On functional module detection in metabolic networks
Functional modules of metabolic networks are essential for understanding the metabolism of an organism as a whole. With the vast amount of experimental data and the construction of complex and large-scale, often genome-wide, models, the computer-aided identification of functional modules becomes more and more important. Since steady states play a key role in biology, many methods have been developed in that context, for example, elementary flux modes, extreme pathways, transition invariants and place invariants. Metabolic networks can be studied also from the point of view of graph theory, and algorithms for graph decomposition have been applied for the identification of functional modules. A prominent and currently intensively discussed field of methods in graph theory addresses the Q-modularity. In this paper, we recall known concepts of module detection based on the steady-state assumption, focusing on transition-invariants (elementary modes) and their computation as minimal solutions of systems of Diophantine equations. We present the Fourier-Motzkin algorithm in detail. Afterwards, we introduce the Q-modularity as an example for a useful non-steady-state method and its application to metabolic networks. To illustrate and discuss the concepts of invariants and Q-modularity, we apply a part of the central carbon metabolism in potato tubers (Solanum tuberosum) as running example. The intention of the paper is to give a compact presentation of known steady-state concepts from a graph-theoretical viewpoint in the context of network decomposition and reduction and to introduce the application of Q-modularity to metabolic Petri net models
Petri nets for systems and synthetic biology
We give a description of a Petri net-based framework for
modelling and analysing biochemical pathways, which uni¯es the qualita-
tive, stochastic and continuous paradigms. Each perspective adds its con-
tribution to the understanding of the system, thus the three approaches
do not compete, but complement each other. We illustrate our approach
by applying it to an extended model of the three stage cascade, which
forms the core of the ERK signal transduction pathway. Consequently
our focus is on transient behaviour analysis. We demonstrate how quali-
tative descriptions are abstractions over stochastic or continuous descrip-
tions, and show that the stochastic and continuous models approximate
each other. Although our framework is based on Petri nets, it can be
applied more widely to other formalisms which are used to model and
analyse biochemical networks
Computational models for inferring biochemical networks
Biochemical networks are of great practical importance. The interaction of biological compounds in cells has been enforced to a proper understanding by the numerous bioinformatics projects, which contributed to a vast amount of biological information. The construction of biochemical systems (systems of chemical reactions), which include both topology and kinetic constants of the chemical reactions, is NP-hard and is a well-studied system biology problem. In this paper, we propose a hybrid architecture, which combines genetic programming and simulated annealing in order to generate and optimize both the topology (the network) and the reaction rates of a biochemical system. Simulations and analysis of an artificial model and three real models (two models and the noisy version of one of them) show promising results for the proposed method.The Romanian National Authority for Scientific Research, CNDI–UEFISCDI,
Project No. PN-II-PT-PCCA-2011-3.2-0917
Reliability modelling of PEM fuel cells with hybrid Petri nets
In this paper, a novel model for dynamic reliability analysis of a PEM fuel cell system is developed using Modelica language in order to account for multi-state dynamics and aging. The modelling approach constitutes the combination of physical and stochastic sub-models with shared variables. The physical model consist of deterministic calculations of the system state described by variables such as temperature, pressure, mass flow rates and voltage output. Additionally, estimated component degradation rates are also taken into account.
The non-deterministic model, on the other hand, is implemented with stochastic Petri nets which represent different events that can occur at random times during fuel cell lifetime. A case study of effects of a cooling system on fuel cell performance was investigated. Monte Carlo simulations of the process resulted in a distribution of system parameters, thus providing an estimate of best and worst scenarios of a fuel cell lifetime
- …