Reachability analysis of a class of hybrid gene regulatory networks - Archive ouverte HAL Access content directly
Conference Papers Year : 2023

Reachability analysis of a class of hybrid gene regulatory networks

Honglu Sun
Maxime Folschette
Morgan Magnin


In this work, we study the reachability analysis method of a class of hybrid system called HGRN which is a special case of hybrid automata. The reachability problem concerned in this work is, given a singular state and a region (a set of states), to determine whether the trajectory from this singular state can reach this region. This problem is undecidable for general hybrid automata, and is decidable only for a restricted class of hybrid automata, but this restricted class does not include HGRNs. A priori, reachability in HGRNs is not decidable; however, we show in this paper that it is decidable in certain cases, more precisely if there is no chaos. Based on this fact, the main idea of this work is that if the decidable cases can be determined automatically, then the reachability problem can be solved partially. The two major contributions are the following: firstly, we classify trajectories into different classes and provide theoretical results about decidability; then based on these theoretical results, we propose a reachability analysis algorithm which always stops in finite time and answers the reachability problem partially (meaning that it can stop with the inconclusive result, for example with the presence of chaos).
Fichier principal
Vignette du fichier
RP2023_reachability.pdf (1.03 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-04180870 , version 1 (14-08-2023)





Honglu Sun, Maxime Folschette, Morgan Magnin. Reachability analysis of a class of hybrid gene regulatory networks. 17th International Conference on Reachability Problems (RP'23), Oct 2023, Nice, France. pp.56-69, ⟨10.1007/978-3-031-45286-4_5⟩. ⟨hal-04180870⟩
59 View
44 Download



Gmail Facebook X LinkedIn More