Minimal trap spaces of logical models are maximal siphons of their Petri net encoding
From MaRDI portal
Publication:2112149
DOI10.1007/978-3-031-15034-0_8zbMath1505.92082OpenAlexW4292227632MaRDI QIDQ2112149
Sylvain Soliman, Kunihiko Hiraishi, Van-Giang Trinh, Belaïd Benhamou
Publication date: 18 January 2023
Full work available at URL: https://doi.org/10.1007/978-3-031-15034-0_8
Related Items (4)
Attractor separation and signed cycles in asynchronous Boolean networks ⋮ Trap spaces of Boolean networks are conflict-free siphons of their Petri net encoding ⋮ Tackling universal properties of minimal trap spaces of Boolean networks ⋮ Attractor identification in asynchronous Boolean dynamics with network reduction
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On enumerating minimal siphons in Petri nets using CLP and SAT solvers: theoretical and practical complexity
- About non-monotony in Boolean automata networks
- Petri net representation of multi-valued logical regulatory graphs
- Computing maximal and minimal trap spaces of Boolean networks
- Graphical conditions for rate independence in chemical reaction networks
- Control strategy identification via trap spaces in Boolean networks
- Synthesis and simulation of ensembles of Boolean networks for cell fate decision
- A survey of siphons in Petri nets
- A Petri net approach to the study of persistence in chemical reaction networks
- Persistence Results for Chemical Reaction Networks with Time-Dependent Kinetics and No Global Conservation Laws
- New Algorithms for Deciding the Siphon-Trap Property
- Applications and Theory of Petri Nets 2004
- Mapping multivalued onto Boolean dynamics
- Concurrency in Boolean networks
This page was built for publication: Minimal trap spaces of logical models are maximal siphons of their Petri net encoding
