On enumerating minimal siphons in Petri nets using CLP and SAT solvers: theoretical and practical complexity
From MaRDI portal
Publication:272014
DOI10.1007/s10601-015-9190-1zbMath1336.92031OpenAlexW1964579890MaRDI QIDQ272014
Faten Nabli, François Fages, Thierry Martinez, Sylvain Soliman
Publication date: 20 April 2016
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10601-015-9190-1
Related Items (4)
Trap spaces of Boolean networks are conflict-free siphons of their Petri net encoding ⋮ Graphical requirements for multistationarity in reaction networks and their verification in BioModels ⋮ Linking Network Structure and Dynamics to Describe the Set of Persistent Species in Reaction Diffusion Systems ⋮ Minimal trap spaces of logical models are maximal siphons of their Petri net encoding
Uses Software
Cites Work
- Identification of all steady states in large networks by logical analysis
- Courcelle's theorem -- a game-theoretic approach
- Priority-based target coverage in directional sensor networks using a genetic algorithm
- A new constraint-based description of the steady-state flux cone of metabolic networks
- A comparison of structural CSP decomposition methods
- Modeling and querying biomolecular interaction networks
- Automata for the verification of monadic second-order graph properties
- Chemical organisation theory
- Deadlocks and traps in Petri nets as Horn-satisfiability solutions and some related polynomially solvable problems
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- New Algorithms for Deciding the Siphon-Trap Property
- Graph minors. II. Algorithmic aspects of tree-width
- Reducibility among Combinatorial Problems
- Computational Methods in Systems Biology
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On enumerating minimal siphons in Petri nets using CLP and SAT solvers: theoretical and practical complexity
