"Coverability, Termination, and Finiteness in Recursive Petri Nets."

Alain Finkel, Serge Haddad, Igor Khmelnitsky (2021)

> Home

Details and statistics

DOI: 10.3233/FI-2021-2081

access: closed

type: Journal Article

metadata version: 2022-02-16

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/fuin/FinkelHK21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/fuin/FinkelHK21
Alain Finkel, Serge Haddad, Igor Khmelnitsky:
Coverability, Termination, and Finiteness in Recursive Petri Nets. Fundam. Informaticae 183(1-2): 33-66 (2021)

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.