Under-approximating Cut Sets for Reachability in Large Scale Automata Networks - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Rapport Année : 2012

Under-approximating Cut Sets for Reachability in Large Scale Automata Networks

Résumé

In the scope of discrete finite-state models of interacting components, and calling the local state of a component a process, we present an algorithm for extracting sets of processes that are necessary for achieving the reachability of a given process. Those sets are referred to as cut sets and are computed from a particular abstract causality structure, so-called Graph of Local Causality, inspired from previous work and generalised here to Communicating Finite State Machines. We apply this new method to a very large model of biological interactions, providing sets of biological entities that, if de-activated, prevent molecules of interest to be active, up to the correctness of the model.
Fichier principal
Vignette du fichier
main.pdf (476 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-00769447 , version 1 (01-01-2013)
hal-00769447 , version 2 (16-01-2013)
hal-00769447 , version 3 (12-07-2013)

Identifiants

  • HAL Id : hal-00769447 , version 1

Citer

Loïc Paulevé, Geoffroy Andrieux, Heinz Koeppl. Under-approximating Cut Sets for Reachability in Large Scale Automata Networks. 2012. ⟨hal-00769447v1⟩
693 Consultations
344 Téléchargements

Partager

Gmail Mastodon Facebook X LinkedIn More