Trap spaces of Boolean networks are conflict-free siphons of their Petri net encoding

DOI10.1016/j.tcs.2023.114073MaRDI QIDQ6175523

Van-Giang Trinh, Belaïd Benhamou, Sylvain Soliman

Publication date: 18 August 2023

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2023.114073

zbMATH Keywords

Petri net; systems biology; Boolean network; siphon; logical model; trap space; attractor computation

Mathematics Subject Classification ID

68Qxx: Theory of computing

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
• Dynamically consistent reduction of logical regulatory graphs
• 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
• Minimal trap spaces of logical models are maximal siphons of their Petri net encoding
• A survey of siphons in Petri nets
• Persistence Results for Chemical Reaction Networks with Time-Dependent Kinetics and No Global Conservation Laws
• New Algorithms for Deciding the Siphon-Trap Property
• RC2: an Efficient MaxSAT Solver
• Applications and Theory of Petri Nets 2004