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-1zbMATH Open1336.92031OpenAlexW1964579890MaRDI QIDQ272014FDOQ272014
Authors: Faten Nabli, Thierry Martinez, François Fages, 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
Recommendations
- New algorithms for deciding the siphon-trap property
- Minimal trap spaces of logical models are maximal siphons of their Petri net encoding
- Computation of strict minimal siphons in a class of Petri nets based on problem decomposition
- Time Petri nets for modelling and analysis of biochemical networks
- On minimality and equivalence of Petri nets
Cites Work
- Reducibility among combinatorial problems
- Identification of all steady states in large networks by logical analysis
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- 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
- New algorithms for deciding the siphon-trap property
- Graph minors. II. Algorithmic aspects of tree-width
- Title not available (Why is that?)
- Title not available (Why is that?)
- Courcelle's theorem -- a game-theoretic approach
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computational Methods in Systems Biology
- Priority-based target coverage in directional sensor networks using a genetic algorithm
Cited In (9)
- Minimal trap spaces of logical models are maximal siphons of their Petri net encoding
- Computation of strict minimal siphons in a class of Petri nets based on problem decomposition
- On minimality and equivalence of Petri nets
- Artificial intelligence in biological modelling
- New algorithms for deciding the siphon-trap property
- Linking network structure and dynamics to describe the set of persistent species in reaction diffusion systems
- Parameterized complexity and approximability of coverability problems in weighted Petri nets
- Graphical requirements for multistationarity in reaction networks and their verification in BioModels
- Trap spaces of Boolean networks are conflict-free siphons of their Petri net encoding
Uses Software
This page was built for publication: On enumerating minimal siphons in Petri nets using CLP and SAT solvers: theoretical and practical complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q272014)
