Sufficient Conditions for Reachability in Automata Networks with Priorities - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Theoretical Computer Science Année : 2015

Sufficient Conditions for Reachability in Automata Networks with Priorities

Maxime Folschette
Loïc Paulevé
Morgan Magnin
Olivier F. Roux
  • Fonction : Auteur

Résumé

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.
Fichier principal
Vignette du fichier
main.pdf (638.34 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01202671 , version 1 (21-09-2015)

Identifiants

Citer

Maxime Folschette, Loïc Paulevé, Morgan Magnin, Olivier F. Roux. Sufficient Conditions for Reachability in Automata Networks with Priorities. Theoretical Computer Science, 2015, ⟨10.1016/j.tcs.2015.08.040⟩. ⟨hal-01202671⟩
278 Consultations
199 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More