Analyses statiques de la dynamique des réseaux d'automates indéterministes

Loïc Paulevé 1, * Maxime Folschette 2 Morgan Magnin 2 Olivier Roux 2
* Corresponding author
2 MeForBio
IRCCyN - Institut de Recherche en Communications et en Cybernétique de Nantes
Abstract : This paper gives an overview of recent results on scalable analysis of automata networks dynamics. We focus on two properties: reachability – given a global state of the network, does it exist a sequence of transition reaching a given local state of a given automaton; and fixed point characterization. Concerning reachability, we give necessary conditions in the general scope of automata networks; and sufficient conditions in the scope of asynchronous automata networks. We address the computation of cut sets for reachability, that are sets of local states, that if disabled make impossible the concerned reachability. Those analyses exploit the concurrency in indeterministic automata networks and rely on abstractions giving compact, non-redundant, but approximate representations of the network dynamics. Such methods have made tractable the analysis of dynamics of biological networks gathering hundreds and thousands of components.
Liste complète des métadonnées

Cited literature [20 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01070295
Contributor : Loïc Paulevé <>
Submitted on : Wednesday, September 9, 2015 - 9:32:13 PM
Last modification on : Wednesday, December 19, 2018 - 3:02:08 PM
Document(s) archivé(s) le : Monday, December 28, 2015 - 10:44:23 PM

File

main.pdf
Files produced by the author(s)

Identifiers

Citation

Loïc Paulevé, Maxime Folschette, Morgan Magnin, Olivier Roux. Analyses statiques de la dynamique des réseaux d'automates indéterministes. Revue des Sciences et Technologies de l'Information - Série TSI : Technique et Science Informatiques, Lavoisier, 2015, 34 (4), pp.22. ⟨10.3166/TSI.34.463-484⟩. ⟨hal-01070295v2⟩

Share

Metrics

Record views

333

Files downloads

178