The state space explosion problem means that the state space of Petri nets (PNs) grows exponentially with PNs’ size. Even the fundamental reachability problem is still an NP-Hard problem in general. It has been proved that the equivalence problem for the reachability set of arbitrary PNs is undecidable except for some subclass of PNs. That is, the reachability problem of arbitrary PNs cannot be solved exactly. Nowadays, there is no efficient and accurate algorithm to solve the problem.
The information provided in our posts or blogs are for educational and informative purposes only. We do not guarantee the accuracy, completeness or suitability of the information. We do not provide financial or investment advice. Readers should always seek professional advice before making any financial or investment decisions based on the information provided in our content. We will not be held responsible for any losses, damages or consequences that may arise from relying on the information provided in our content.