"Cyclic Petri net reachability sets are semi-linear effectively constructible."

Zakaria Bouziane, Alain Finkel (1997)

> Home

Details and statistics

DOI: 10.1016/S1571-0661(05)80423-2

access: open

type: Conference or Workshop Paper

metadata version: 2021-02-12

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/entcs/BouzianeF97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/entcs/BouzianeF97
Zakaria Bouziane, Alain Finkel:
Cyclic Petri net reachability sets are semi-linear effectively constructible. INFINITY 1997: 15-24

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.