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.
@inproceedings{NakamuraNI89,
title = {A Class of Petri Nets and a Reachability Problem Solvable in Deterministic Polynomial Time},
author = {Keiko Nakamura and Kiyohiko Nakamura and Atsunobu Ichikawa},
year = {1989},
researchr = {https://researchr.org/publication/NakamuraNI89},
cites = {0},
citedby = {0},
pages = {258-265},
booktitle = {Petri Nets and Performance Models, The Proceedings of the Third International Workshop, PNPM 89, Kyoto, Japan, December 11-13, 1989},
publisher = {IEEE Computer Society},
isbn = {0-8186-2001-3},
}