More Web Proxy on the site http://driver.im/

default search action

combined dblp search
author search
venue search
publication search

ask others

"Plain, Bounded, Reversible, Persistent, and k-marked Petri Nets Have ..."

Eike Best, Harro Wimmel (2016)

> Home

Details and statistics

DOI: 10.1007/978-3-319-45994-3_4

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/rp/BestW16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/rp/BestW16
Eike Best, Harro Wimmel:
Plain, Bounded, Reversible, Persistent, and k-marked Petri Nets Have Marked Graph Reachability Graphs. RP 2016: 51-62

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.