KaDE: A Tool to Compile Kappa Rules into (Reduced) ODE Models

@inproceedings{Camporesi2017KaDEAT,
  title={KaDE: A Tool to Compile Kappa Rules into (Reduced) ODE Models},
  author={Ferdinanda Camporesi and J{\'e}r{\^o}me Feret and Kim Quy{\^e}n L{\'y}},
  booktitle={CMSB},
  year={2017}
}
Kappa is a formal language that can be used to model systems of biochemical interactions among proteins. It offers several semantics to describe the behaviour of Kappa models at different levels of abstraction. Each Kappa model is a set of context-free rewrite rules. One way to understand the semantics of a Kappa model is to read its rules as an implicit description of a (potentially infinite) reaction network. KaDE is interpreting this definition to compile Kappa models into reaction networks… 
Formal Analysis of Rule-Based Models in Systems Biology
TLDR
This paper first turns BCS into a completely formal language with rigorously defined semantics by means of a simplified Kappa calculus, and supports BCS with translation to BNGL, a well-known practically used rule-based language.
Executable biochemical space for specification and analysis of biochemical systems
TLDR
The second generation of a rule-based language called Biochemical Space Language (BCSL) is presented that combines the advantages of different approaches and thus makes an effort to overcome several problems of existing solutions.
Combinatorial Conversion and Moment Bisimulation for Stochastic Rewriting Systems
TLDR
A novel method to analyze the dynamics of stochastic rewriting systems evolving over finitary adhesive, extensive categories is developed and the concept of combinatorial conversion is introduced, whereby under certain technical conditions the evolution equation for the statistical moments of observables can be expressed as the action of certain differential operators on formal power series.
Symbolic computation of differential equivalences
TLDR
This work proposes differential equivalence relations for biochemical models from the literature that cannot be reduced using competing automatic techniques, and provides novel symbolic procedures to check an equivalence and compute the largest one via partition refinement algorithms that use satisfiability modulo theories.
Compositionality of Rewriting Rules with Conditions
TLDR
An intricate interplay is uncovered between the category-theoretical concepts of conditions on rules and morphisms, the compositionality and compatibility of certain shift and transport constructions for conditions, and the property of associativity of the composition of rules.
Pleione: A tool for statistical and multi-objective calibration of Rule-based models
TLDR
The software called Pleione is presented, which distributes stochastic simulations and calculations and incorporates equivalence tests to determine the fitness of RBMs compared with data and yielded satisfactory results regarding calculation time and error reduction for multiple simulators, models, parameter search strategies, and computing infrastructures.
The Bond-Calculus: A Process Algebra for Complex Biological Interaction Dynamics
TLDR
The bond-calculus is presented, a process algebra for modelling biological and chemical systems featuring nonlinear dynamics, multiway interactions, and dynamic bonding of agents, and is applied to an existing biological model: Kuznetsov's classic model of tumour immune interactions.
Embodying probabilistic inference in biochemical circuits
TLDR
It is argued that this process by which an abstract computation is shaped by its biochemical realization strikes a compromise between "rationalistic" information-processing perspectives and alternative approaches that emphasize embodiment.
...
...

References

SHOWING 1-10 OF 26 REFERENCES
Abstracting the Differential Semantics of Rule-Based Models: Exact and Automated Model Reduction
TLDR
A reduction method is constructed which generates (typically) far smaller systems of differential equations than the concrete/canonical one, and it is shown that the abstract/reduced differential system has solutions which are linear combinations of the canonical ones.
Formal molecular biology
Incremental Update for Graph Rewriting
TLDR
An algorithm based on a data structure, called extension basis, that can be used to update the counts of predefined graph observables after a rule of the model has been applied and the correctness of the procedure is proven using a purely domain theoretic argument.
Formal Reduction for Rule-based Models
Forward and Backward Bisimulations for Chemical Reaction Networks
TLDR
A unified algorithm is provided that computes the coarsest refinement up to the authors' bisimulations in polynomial time and algorithms to compute quotient CRNs induced by a bisimulation are given.
Stochastic Fragments: A Framework for the Exact Reduction of the Stochastic Semantics of Rule-Based Models
TLDR
This paper introduces an individual-based stochastic semantics (where each agent is identified by a unique identifier) for the programs of a rule-based language and uses this framework for deriving a sound population-based semantics and a sound fragments- based semantics.
Efficient Syntax-Driven Lumping of Differential Equations
TLDR
Numerical experiments on real-world models from biochemistry, electrical engineering, and structural mechanics show that the prototype is able to handle ODEs with millions of variables and monomials, providing significant model reductions.
Combining Model Reductions
Rule-based modeling of biochemical systems with BioNetGen.
TLDR
This work focuses on how a rule-based model is specified in the BioNetGen language (BNGL) and how a model specification is analyzed using the Bio netGen software tool.
The Systems Biology Markup Language (SBML): Language Specification for Level 3 Version 1 Core
TLDR
This document provides the specification for Version 1 of SBML Level 3 Core, which defines the data structures prescribed by SBML as well as their encoding in XML, the eXtensible Markup Language.
...
...