Goal-Oriented Reduction of Automata Networks - Archive ouverte HAL Access content directly
Conference Papers Year :

Goal-Oriented Reduction of Automata Networks

Loïc Paulevé


We consider networks of finite-state machines having local transitions conditioned by the current state of other automata. In this paper, we depict a reduction procedure tailored for a given reachability property of the form ``from global state s there exists a sequence of transitions leading to a state where an automaton g is in a local state T'. By exploiting a causality analysis of the transitions within the individual automata, the proposed reduction removes local transitions while preserving all the minimal traces that satisfy the reachability property. The complexity of the procedure is polynomial in the total number of local states and transitions, and exponential in the number of local states within one automaton. Applied to automata networks modelling dynamics of biological systems, we observe that the reduction shrinks down significantly the reachable state space, enhancing the tractability of the model-checking of large networks.
Fichier principal
Vignette du fichier
gored.pdf (332.98 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01149118 , version 1 (06-05-2015)
hal-01149118 , version 2 (06-05-2016)



Loïc Paulevé. Goal-Oriented Reduction of Automata Networks. 14th International Conference on Computational Methods in Systems Biology (CMSB 2016), Sep 2016, Cambridge, United Kingdom. pp.252-272, ⟨10.1007/978-3-319-45177-0_16⟩. ⟨hal-01149118v2⟩
254 View
407 Download



Gmail Facebook Twitter LinkedIn More