Reachability analysis via orthogonal sets of patterns - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2016

Reachability analysis via orthogonal sets of patterns

Résumé

Rule-based modelling languages, such as Kappa, allow for the description of very detailed mechanistic models. Yet, as the rules become more and more numerous, there is a need for formal methods to enhance the level of confidence in the models that are described with these languages. We develop abstract interpretation tools to capture invariants about the biochemical structure of the bio-molecular species that may occur in a given model. In previous works, we have focused on the relationships between the states of the sites that belong to the same instance of a protein. This comes down to detect for a specific set of patterns, which ones may be reachable during the execution of the model. In this paper, we generalise this approach to a broader family of abstract domains that we call orthogonal sets of patterns. More precisely, an orthogonal set of patterns is obtained by refining recursively the information about some patterns containing a given protein, so as to partition the set of occurrences of this protein in any mixture. We show that orthogonal sets of patterns offer a convenient choice to design scalable and accurate static analyses. As an example, we use them to infer properties in models with transport of molecules (more precisely, we show that each pair of proteins that are connected, always belong to the same compartment), and models involving double bindings (we show that whenever a protein of type A is bound twice to proteins of type B, then the protein A is necessarily bound twice to the same instance of the protein B).
Fichier principal
Vignette du fichier
orthogonal_patterns.pdf (396.58 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01379902 , version 1 (15-11-2016)

Identifiants

  • HAL Id : hal-01379902 , version 1

Citer

Jérôme Feret, Kim Quyen Ly. Reachability analysis via orthogonal sets of patterns. 7th International Workshop on Static Analysis and Systems Biology, (SASB 2016), David Safranek; Guido Sanguinetti, Sep 2016, Edinburgh, United Kingdom. ⟨hal-01379902⟩
369 Consultations
116 Téléchargements

Partager

Gmail Facebook X LinkedIn More