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

Keiko Nakamura Kiyohiko Nakamura Atsunobu Ichikawa

Published in: PNPM (1989)

Keyphrases

petri net
special case
manufacturing systems
discrete event systems
high level petri nets
petri net model
computational complexity
colored petri nets
np hard
service composition
state machines
fuzzy petri net
ims ld
concurrent systems
turing machine