Abstract
Analysis of net invariants has proved to be a powerful technique for investigating properties of concurrent systems modelled by generalized Petri nets. Unfortunately, the best known algorithms for invariant search have an exponential cost, leading in many real cases to unacceptable consumption of computing resources. An algorithm is presented here which, although still exponentially complex, introduces significant optimizations that are meant to considerably extend the practical feasibility of invariant analysis. After a short summary of the invariant method and a brief recall of existing algorithms, the features of the new algorithm are developed and proved. The optimizations proposed here could be successfully taken into account when designing new algorithms for high level Petri nets.
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.
