On enumerating minimal siphons in Petri nets using CLP and SAT solvers: theoretical and practical complexity

Faten Nabli, Thierry Martinez, François Fages, Sylvain Soliman. On enumerating minimal siphons in Petri nets using CLP and SAT solvers: theoretical and practical complexity. Constraints, 21(2):251-276, 2016. [doi]

Abstract

Abstract is missing.