On Enumerating Minimal Siphons in Petri nets using CLP and SAT solvers: Theoretical and Practical Complexity - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Constraints Year : 2016

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

Abstract

no abstract
Fichier principal
Vignette du fichier
NMFS12constraints.pdf (439.74 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01170962 , version 1 (11-05-2020)

Identifiers

Cite

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

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More