Abstract
This study develops the theory to enumerate the reachable states of marked graphs that are a simple subclass of Petri nets where every place has a single input and output transition without the construction of a reachability graph (RG), which, as far as the authors know, does not receive much attention in the previous studies. Usually, it is necessary to enumerate all the reachable states of a plant to be controlled. However, the construction of an RG suffers from the state explosion problem. This study tackles the problem for a special class of Petri nets by expressing and finding the number of reachable states in an algebraic way.
Sign-in/Register to access full text options 
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.
