Abstract
Using linear algebraic techniques, we analyse the computational complexity of testing reachability in Petri nets for which markings can grow very fast. This leads to two subclasses of Petri nets for which the reachability problem is PSPACE-complete. These subclasses are not contained in any other subclass for which complexity of the reachability problem was known, such as those given in Esparza and Nielsen's survey [Esparza, J. and M. Nielsen, Decidability issues for Petri nets — a survey, J. Inform. Process. Cybernet. 30 (1994), pp. 143–160]. We give an example where further extension of our subclasses fails to maintain the upper bound.
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.
