"On enumerating minimal siphons in Petri nets using CLP and SAT solvers: ..."

Faten Nabli et al. (2016)

> Home

Details and statistics

DOI: 10.1007/S10601-015-9190-1

access: closed

type: Journal Article

metadata version: 2023-03-21

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/constraints/NabliMFS16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/constraints/NabliMFS16
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 An Int. J. 21(2): 251-276 (2016)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.