Abstract

An investigation into the relationships between Petri net (PN) models and their associated state-space is discussed. An algorithm to estimate an upper bound on the number of states in a PN is presented. This algorithm is based on the weight vector associated with conservative PNs. PN constructs that hinder the algorithm's accuracy are discussed. Additionally, the structural and behavioral nature of PN weighted conservatism is developed, and a clarification of a test of weighted conservativeness is presented. >

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.