Characterization of Reachable Attractors Using Petri Net Unfoldings - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2014

Characterization of Reachable Attractors Using Petri Net Unfoldings


Attractors of network dynamics represent the long-term behaviours of the modelled system. Their characterization is therefore crucial for understanding the response and differentiation capabilities of a dynamical system. In the scope of qualitative models of interaction networks, the computation of attractors reachable from a given state of the network faces combinatorial issues due to the state space explosion. In this paper, we present a new algorithm that exploits the concurrency between transitions of parallel acting components in order to reduce the search space. The algorithm relies on Petri net unfoldings that can be used to compute a compact representation of the dynamics. We illustrate the applicability of the algorithm with Petri net models of cell signalling and regulation networks, Boolean and multi-valued. The proposed approach aims at being complementary to existing methods for deriving the attractors of Boolean models, while being %so far more generic since it applies to any safe Petri net.
Fichier principal
Vignette du fichier
unfolding_for_attractors.pdf (318.4 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-01060450 , version 1 (03-09-2014)



Thomas Chatain, Stefan Haar, Loïg Jezequel, Loïc Paulevé, Stefan Schwoon. Characterization of Reachable Attractors Using Petri Net Unfoldings. CMSB 2014, Nov 2014, Manchester, United Kingdom. pp.14, ⟨10.1007/978-3-319-12982-2_10⟩. ⟨hal-01060450⟩
526 View
330 Download



Gmail Mastodon Facebook X LinkedIn More