Skip to Main content Skip to Navigation
Conference papers

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

Ferdinanda Camporesi 1 Jérôme Feret 1 Kim Quyen Ly 1
1 ANTIQUE - Analyse Statique par Interprétation Abstraite
DI-ENS - Département d'informatique de l'École normale supérieure, Inria de Paris
Abstract : Kappa is a formal language that can be used to model sys- tems of biochemical interactions among proteins. It offers several se- mantics 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 net- work. KaDE is interpreting this definition to compile Kappa models into reaction networks (or equivalently into sets of ordinary differential equations). KaDE uses a static analysis that identifies pairs of sites that are indistinguishable from the rules point of view, to infer backward and forward bisimulations, hence reducing the size of the underlying reaction networks without having to generate them explicitly. In this paper, we describe the main current functionalities of KaDE and we give some benchmarks on case studies.
Document type :
Conference papers
Complete list of metadata

Cited literature [25 references]  Display  Hide  Download
Contributor : Jérôme Feret <>
Submitted on : Wednesday, October 11, 2017 - 7:45:57 AM
Last modification on : Tuesday, May 4, 2021 - 2:06:02 PM
Long-term archiving on: : Friday, January 12, 2018 - 12:44:50 PM


Files produced by the author(s)






Ferdinanda Camporesi, Jérôme Feret, Kim Quyen Ly. KaDE: A Tool to Compile Kappa Rules into (Reduced) ODE Models. CMSB 2017 - 15th Conference on Computational Methods in Systems Biology, Heinz Koeppl, Sep 2017, Darmstadt, Germany. pp.291-299, ⟨10.1007/978-3-319-67471-1_18⟩. ⟨hal-01613600⟩



Record views


Files downloads