6,951 research outputs found
Compositional Performance Modelling with the TIPPtool
Stochastic process algebras have been proposed as compositional specification formalisms for performance models. In this paper, we describe a tool which aims at realising all beneficial aspects of compositional performance modelling, the TIPPtool. It incorporates methods for compositional specification as well as solution, based on state-of-the-art techniques, and wrapped in a user-friendly graphical front end. Apart from highlighting the general benefits of the tool, we also discuss some lessons learned during development and application of the TIPPtool. A non-trivial model of a real life communication system serves as a case study to illustrate benefits and limitations
BlenX-based compositional modeling of complex reaction mechanisms
Molecular interactions are wired in a fascinating way resulting in complex
behavior of biological systems. Theoretical modeling provides a useful
framework for understanding the dynamics and the function of such networks. The
complexity of the biological networks calls for conceptual tools that manage
the combinatorial explosion of the set of possible interactions. A suitable
conceptual tool to attack complexity is compositionality, already successfully
used in the process algebra field to model computer systems. We rely on the
BlenX programming language, originated by the beta-binders process calculus, to
specify and simulate high-level descriptions of biological circuits. The
Gillespie's stochastic framework of BlenX requires the decomposition of
phenomenological functions into basic elementary reactions. Systematic
unpacking of complex reaction mechanisms into BlenX templates is shown in this
study. The estimation/derivation of missing parameters and the challenges
emerging from compositional model building in stochastic process algebras are
discussed. A biological example on circadian clock is presented as a case study
of BlenX compositionality
MeGARA: Menu-based Game Abstraction and Abstraction Refinement of Markov Automata
Markov automata combine continuous time, probabilistic transitions, and
nondeterminism in a single model. They represent an important and powerful way
to model a wide range of complex real-life systems. However, such models tend
to be large and difficult to handle, making abstraction and abstraction
refinement necessary. In this paper we present an abstraction and abstraction
refinement technique for Markov automata, based on the game-based and
menu-based abstraction of probabilistic automata. First experiments show that a
significant reduction in size is possible using abstraction.Comment: In Proceedings QAPL 2014, arXiv:1406.156
Compositionality, stochasticity and cooperativity in dynamic models of gene regulation
We present an approach for constructing dynamic models for the simulation of
gene regulatory networks from simple computational elements. Each element is
called a ``gene gate'' and defines an input/output-relationship corresponding
to the binding and production of transcription factors. The proposed reaction
kinetics of the gene gates can be mapped onto stochastic processes and the
standard ode-description. While the ode-approach requires fixing the system's
topology before its correct implementation, expressing them in stochastic
pi-calculus leads to a fully compositional scheme: network elements become
autonomous and only the input/output relationships fix their wiring. The
modularity of our approach allows to pass easily from a basic first-level
description to refined models which capture more details of the biological
system. As an illustrative application we present the stochastic repressilator,
an artificial cellular clock, which oscillates readily without any cooperative
effects.Comment: 15 pages, 8 figures. Accepted by the HFSP journal (13/09/07
- âŠ