Pages that link to "Item:Q272014"
From MaRDI portal
The following pages link to On enumerating minimal siphons in Petri nets using CLP and SAT solvers: theoretical and practical complexity (Q272014):
Displaying 7 items.
- Parameterized complexity and approximability of coverability problems in weighted Petri nets (Q1662545) (← links)
- Graphical requirements for multistationarity in reaction networks and their verification in BioModels (Q1712870) (← links)
- Minimal trap spaces of logical models are maximal siphons of their Petri net encoding (Q2112149) (← links)
- Computation of strict minimal siphons in a class of Petri nets based on problem decomposition (Q2293269) (← links)
- Linking Network Structure and Dynamics to Describe the Set of Persistent Species in Reaction Diffusion Systems (Q5860635) (← links)
- Trap spaces of Boolean networks are conflict-free siphons of their Petri net encoding (Q6175523) (← links)
- Artificial intelligence in biological modelling (Q6602271) (← links)