Abstract
We motivate the study of certain classes of acyclic Petri nets and consider the reachability problem for these classes of Petri nets, providing various NP-completeness results. We also show how the reachability problem for the class of acyclic elementary net systems appears to be harder than it is for the (seemingly comparable) class of 1-bounded acyclic Petri nets.
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 callDisclaimer: 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.
