On enumerating minimal siphons in Petri nets using CLP and SAT solvers: theoretical and practical complexity
Crossref DOI link: https://doi.org/10.1007/s10601-015-9190-1
Published Online: 2015-04-10
Published Print: 2016-04
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Nabli, Faten
Martinez, Thierry
Fages, François
Soliman, Sylvain
Text and Data Mining valid from 2015-04-10