Abstract

In this insightful and timely article, several approaches relevant for verification are discussed for combatting the prohibitively high complexity of the reachability problem for Petri nets. The author generously shares his knowledge of the state of the art, identifying promising directions for immediate further research.

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.