A Class of Petri Nets and a Reachability Problem Solvable in Deterministic Polynomial Time - researchr publication

researchr

You are not signed in
Sign in
Sign up

Keiko Nakamura, Kiyohiko Nakamura, Atsunobu Ichikawa. A Class of Petri Nets and a Reachability Problem Solvable in Deterministic Polynomial Time. In Petri Nets and Performance Models, The Proceedings of the Third International Workshop, PNPM 89, Kyoto, Japan, December 11-13, 1989. pages 258-265, IEEE Computer Society, 1989.

Abstract is missing.

runs on WebDSL