Abstract

This paper addresses the problem of state explosion and computational complexity in solving marked graph Stochastic Petri Nets (SPNs). We first develop a simple and powerful Petri Nets (PNs) reduction technique that reduces the size of a marked graph PN. Then we propose an iterative delay equivalent reduction technique to solve the reduced SPN. This method iteratively tunes two or more partly aggregated auxiliary SPNs until they are approximately delay equivalent to the original SPN. It avoids the direct solution of the original SPN. In our experience the iteration usually converges and the accuracy is usually better than 5%, though there are exceptional cases. The technique is a step towards approximating more general SPNs.

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.