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
Published version (Free)

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