"Minimal Coverability Set for Petri Nets: Karp and Miller Algorithm with ..."

Pierre-Alain Reynier, Frédéric Servais (2013)

> Home

Details and statistics

DOI: 10.3233/FI-2013-781

access: closed

type: Journal Article

metadata version: 2020-09-18

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/fuin/ReynierS13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/fuin/ReynierS13
Pierre-Alain Reynier, Frédéric Servais:
Minimal Coverability Set for Petri Nets: Karp and Miller Algorithm with Pruning. Fundam. Informaticae 122(1-2): 1-30 (2013)

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.