Title :
A class of Petri nets and a reachability problem solvable in deterministic polynomial time
Author :
Nakamura, Kentaro ; Nakamura, Kentaro ; Ichikawa, Akihiko
Author_Institution :
Graduate Sch. of Sci. & Eng., Tokyo Inst. of Technol., Japan
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
Keywords :
Petri nets; computational complexity; Petri nets; computational complexity; deterministic polynomial time; reachability problem; state machines; sufficient conditions; Bars; Computational complexity; Concurrent computing; Fires; Petri nets; Polynomials; Power system modeling; Sufficient conditions; Tellurium; Tiles;
Conference_Titel :
Petri Nets and Performance Models, 1989. PNPM89., Proceedings of the Third International Workshop on
Conference_Location :
Kyoto
DOI :
10.1109/PNPM.1989.68559
