Abstract
Generalized stochastic Petri nets (GSPNs) can be effectively used to represent many systems in a compact way. Efficient algorithms for the translation of a GSPN into its underlying continuous-time Markov chain (CTMC) are known and have been implemented in a number of software packages. While GSPNs relieve the modeler from the cumbersome and error-prone task of building and inputting the CTMC by hand, their analytical tractability is still limited by the combinatorial growth of the underlying CTMC. In order to avoid construction and solution of a large CTMC, we propose decomposing the GSPN into a set of subnets and separately solving individual subnets. Dependence among the subnets requires that, after solving each 566subnet, certain quantities be exported to other subnets. A fixed-point iteration is then used over the exported quantities. We discuss ways of decomposing a net into subnets, the type of quantities that need to be exchanged between subnets, and the convergence of the fixed-point iterative schemes.
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.
