A class of Petri nets and a reachability problem solvable in deterministic polynomial time

Keiko Nakamura,Kiyohiko Nakamura,Atsunobu Ichikawa

doi:10.1109/pnpm.1989.68559

A class of Petri nets and a reachability problem solvable in deterministic polynomial time

Keiko Nakamura, Kiyohiko Nakamura + Show 1 more

https://doi.org/10.1109/pnpm.1989.68559

Copy DOI

Publication Date: Jan 1, 1989

Citations: 1

Affiliation: Tokyo Institute of Technology

#Deterministic Polynomial Time #Class Of Petri Nets + Show 8 more

Abstract
Full-Text PDF
Similar Papers

Abstract

The computational complexity of reachability problems for Petri nets is analyzed and a new class of Petri nets is introduced. A net of the class is composed of subnets of state machines. Sufficient conditions on initial and target markings are obtained under which the reachability problem for the class is solvable in deterministic polynomial time. Also presented is an algorithm that examines in deterministic polynomial time whether a Petri net is in the class. >

Full Text

Paper version not known

Open DOI Link

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Similar Papers

Paper Title

Journal

Date

Author

View more papers

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.