On Enumerating Minimal Siphons in Petri nets using CLP and SAT solvers: Theoretical and Practical Complexity - Archive ouverte HAL Access content directly
Journal Articles Constraints Year : 2016

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

Faten Nabli
  • Function : Author
  • PersonId : 939831
Computational systems biology and optimization
Thierry Martinez
  • Function : Author
  • PersonId : 939832
Computational systems biology and optimization
François Fages
Computational systems biology and optimization
Sylvain Soliman
Computational systems biology and optimization
CV

Abstract

no abstract

Domains

Computer Science [cs] Programming Languages [cs.PL]
Fichier principal
Vignette du fichier
NMFS12constraints.pdf (439.74 Ko) Télécharger le fichier
Origin Files produced by the author(s)

virginie collette  : Connect in order to contact the contributor

https://hal.science/hal-01170962

Submitted on : Monday, May 11, 2020-12:59:15 PM

Last modification on : Wednesday, March 15, 2023-8:56:17 AM

Download

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⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

INRIA INRIA2 UNIV-PARIS-SACLAY GS-COMPUTER-SCIENCE
478 View
131 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More