Sufficient Conditions for Reachability in Automata Networks with Priorities

Maxime Folschette 1, 2 Loïc Paulevé 3 Morgan Magnin 1 Olivier Roux 1
1 MeForBio
IRCCyN - Institut de Recherche en Communications et en Cybernétique de Nantes
Abstract : In this paper, we develop a framework for an efficient under-approximation of the dynamics of Asynchronous Automata Networks (AANs). An AAN is an Automata Network with synchronised transitions between automata, where each transition changes the local state of exactly one automaton (but any number of synchronizing local states are allowed). The work we propose here is based on static analysis by abstract interpretation, which allows to prove that reaching a state with a given property is possible, without the same computational cost of usual model checkers: the complexity is polynomial with the total number of local states and exponential with the number of local states within a single automaton. Furthermore, we address AANs with classes of priorities, and give an encoding into AANs without priorities, thus extending the application range of our under-approximation. Finally, we illustrate our method for the model checking of large-scale biological networks.
Liste complète des métadonnées

Littérature citée [21 références]  Voir  Masquer  Télécharger
Contributeur : Maxime Folschette <>
Soumis le : lundi 21 septembre 2015 - 15:19:46
Dernière modification le : mercredi 19 décembre 2018 - 15:02:08
Document(s) archivé(s) le : mardi 29 décembre 2015 - 09:01:13


Fichiers produits par l'(les) auteur(s)



Maxime Folschette, Loïc Paulevé, Morgan Magnin, Olivier Roux. Sufficient Conditions for Reachability in Automata Networks with Priorities. Theoretical Computer Science, Elsevier, 2015, 〈〉. 〈10.1016/j.tcs.2015.08.040〉. 〈hal-01202671〉



Consultations de la notice


Téléchargements de fichiers