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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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
