Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, EpiSciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Journal articles

On Enumerating Minimal Siphons in Petri nets using CLP and SAT solvers: Theoretical and Practical Complexity

Abstract : no abstract
Document type :
Journal articles
Complete list of metadata

Cited literature [49 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01170962
Contributor : virginie collette Connect in order to contact the contributor
Submitted on : Monday, May 11, 2020 - 12:59:15 PM
Last modification on : Friday, February 4, 2022 - 3:29:32 AM

File

NMFS12constraints.pdf
Files produced by the author(s)

Identifiers

Citation

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, Springer Verlag, 2016, 21 (2), pp.251--276. ⟨10.1007/s10601-015-9190-1⟩. ⟨hal-01170962⟩

Share

Metrics

Record views

426

Files downloads

78