By Topic

Exploiting stochastic process algebra achievements for generalized stochastic Petri nets

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Hermanns, H. ; IMMD VII, Erlangen-Nurnberg Univ., Germany ; Herzog, U. ; Mertsiotakis, V. ; Rettelbach, M.

Constructing large generalized stochastic Petri nets (GSPN) by hierarchical composition of smaller components is a promising way to cope with the complexity of the design process for models of real hardware and software systems. The composition of nets is inspired by process algebraic operators. A solid theoretical framework of such operators relies on equivalences that are substitutive with respect to the operators. Practically important, such equivalences allow compositional reduction techniques, where components may be replaced by smaller but equivalent nets without affecting significant properties of the whole model. However substitutive equivalence notions for GSPN have not been published. In this paper we adopt operators and equivalences originally developed in the context of stochastic process algebras to GSPN. The equivalences are indeed substitutive with respect to two composition operators, parallel composition and hiding. This bears the potential to exploit hierarchies in the model definition to obtain performance indices of truly large composite GSPN by stepwise compositional reduction. We illustrate the effect of composition as well as compositional reduction by means of a running example. A case study of a workstation cluster highlights the potential of compositional reduction

Published in:

Petri Nets and Performance Models, 1997., Proceedings of the Seventh International Workshop on

Date of Conference:

3-6 Jun 1997