Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"A Class of Petri Nets and a Reachability Problem Solvable in Deterministic ..."

Keiko Nakamura, Kiyohiko Nakamura, Atsunobu Ichikawa (1989)

> Home

Details and statistics

DOI: 10.1109/PNPM.1989.68559

access: closed

type: Conference or Workshop Paper

metadata version: 2023-03-24

- view
  authority control:
- export record
  dblp key:
  - conf/pnpm/NakamuraNI89
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/pnpm/NakamuraNI89
Keiko Nakamura, Kiyohiko Nakamura, Atsunobu Ichikawa:
A Class of Petri Nets and a Reachability Problem Solvable in Deterministic Polynomial Time. PNPM 1989: 258-265

a service of

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.