On enumerating minimal siphons in Petri nets using CLP and SAT solvers: theoretical and practical complexity
From MaRDI portal
(Redirected from Publication:272014)
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
- A comparison of structural CSP decomposition methods
- A new constraint-based description of the steady-state flux cone of metabolic networks
- Automata for the verification of monadic second-order graph properties
- Chemical organisation theory
- Computational Methods in Systems Biology
- Courcelle's theorem -- a game-theoretic approach
- Deadlocks and traps in Petri nets as Horn-satisfiability solutions and some related polynomially solvable problems
- Graph minors. II. Algorithmic aspects of tree-width
- scientific article; zbMATH DE number 4045165 (Why is no real title available?)
- scientific article; zbMATH DE number 3722109 (Why is no real title available?)
- scientific article; zbMATH DE number 1950443 (Why is no real title available?)
- scientific article; zbMATH DE number 2090521 (Why is no real title available?)
- Identification of all steady states in large networks by logical analysis
- Modeling and querying biomolecular interaction networks
- New algorithms for deciding the siphon-trap property
- Priority-based target coverage in directional sensor networks using a genetic algorithm
- Reducibility among combinatorial problems
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
Cited in
(9)- Parameterized complexity and approximability of coverability problems in weighted Petri nets
- Graphical requirements for multistationarity in reaction networks and their verification in BioModels
- 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
- New algorithms for deciding the siphon-trap property
- On minimality and equivalence of Petri nets
- Linking network structure and dynamics to describe the set of persistent species in reaction diffusion systems
- Trap spaces of Boolean networks are conflict-free siphons of their Petri net encoding
- Artificial intelligence in biological modelling
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)
