Abstract
We examine the reachability, containment, and equivalence problems for structurally bounded and conservative Petri nets. Using techniques from the theory of linear optimization, we derive an upper bound on the size of any reachable marking for a structurally bounded Petri net. By employing Savitch's Theorem, we use this bound to show all three problems for both structurally bounded and conservative Petri nets to be in PSPACE. These three problems are already known to be PSPACE-complete for 1-conservative Petri nets; therefore, since 1-conservative Petri nets are both conservative and structurally bounded, it follows that all three problems for consecutive and structurally bounded Petri nets are PSPACE-complete.
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.
