"Coverability of Reset Petri Nets and Other Well-Structured Transition ..."

Michael Leuschel, Helko Lehmann (2000)

> Home

Details and statistics

DOI: 10.1007/3-540-44957-4_7

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/cl/LeuschelL00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cl/LeuschelL00
Michael Leuschel, Helko Lehmann:
Coverability of Reset Petri Nets and Other Well-Structured Transition Systems by Partial Deduction. Computational Logic 2000: 101-115

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.