On enumerating minimal siphons in Petri nets using CLP and SAT solvers: theoretical and practical complexity (Q272014)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On enumerating minimal siphons in Petri nets using CLP and SAT solvers: theoretical and practical complexity |
scientific article; zbMATH DE number 6570969
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On enumerating minimal siphons in Petri nets using CLP and SAT solvers: theoretical and practical complexity |
scientific article; zbMATH DE number 6570969 |
Statements
On enumerating minimal siphons in Petri nets using CLP and SAT solvers: theoretical and practical complexity (English)
0 references
20 April 2016
0 references
Petri nets
0 references
siphons
0 references
systems biology
0 references
sat
0 references
constraint logic programming
0 references
0 references
0 references
0.7920404076576233
0 references
0.7895963788032532
0 references
0.7849554419517517
0 references
0.7674661874771118
0 references
0.766069769859314
0 references
