Abstract

Petri nets can be viewed as graphical models and mathematical tools to study discrete event system. As a basic analysis tool of Petri nets, reachability trees are fundamental for systematically investigating many characteristics. In this paper, a new reachability tree for unbounded generalized Petri nets is proposed. This new method can decrease the number of nodes in the new reachability tree besides avoidance of some spurious markings which appear in other reachability trees. Several examples are provided to illustrate its superiority.

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

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.