Abstract
Generalized Stochastic Petri Nets (GSPN) have gained a wide acceptance as a modeling tool for the performance analysis of concurrent systems. However, the applicability of this methodology is severely limited by the potential state space explosion phenomenon. In this paper we describe massively parallel approaches to the most computing-intensive part of the solution of GSPN models: the state space construction. The effectiveness of these parallel approaches stays, for every GSPN, in their ability to deal with very large reachability spaces in reasonable time. Both the SIMD and the MIMD programming models are considered, and examples are given using recent massively parallel processing architectures (CM-5, T3D).
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.
