"Das Erreichbarkeitsproblem für Stetige Petri-Netze ist entscheidbar."

Nicolas Schiller (1999)

> Home

Details and statistics

DOI: —

access: open

type: Conference or Workshop Paper

metadata version: 2023-03-10

- view
  - electronic edition @ ceur-ws.org (open access)
- export record
  dblp key:
  - conf/awpn/Schiller99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/awpn/Schiller99
Nicolas Schiller:
Das Erreichbarkeitsproblem für Stetige Petri-Netze ist entscheidbar. AWPN 1999

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.