Performance models of multiprocessor systems
Performance models of multiprocessor systems
IFIP TC6/ 6.1 international conference on formal description techniques IX/protocol specification, testing and verification XVI on Formal description techniques IX : theory, application and tools: theory, application and tools
Communication and Concurrency
Stochastic Well-Formed Colored Nets and Symmetric Modeling Applications
IEEE Transactions on Computers
Generalized Stochastic Petri Nets: A Definition at the Net Level and its Implications
IEEE Transactions on Software Engineering
A Notion of Equivalence for Stochastic Petri Nets
Proceedings of the 16th International Conference on Application and Theory of Petri Nets
The PSR Methodology: Integrating Hardware and Software Models
Proceedings of the 17th International Conference on Application and Theory of Petri Nets
A survey of equivalence notions for net based systems
Advances in Petri Nets 1992, The DEMON Project
The box calculus: a new causal algebra with multi-label communication
Advances in Petri Nets 1992, The DEMON Project
Superposed Generalized Stochastic Petri Nets: Definition and Efficient Solution
Proceedings of the 15th International Conference on Application and Theory of Petri Nets
PEPA nets: a structured performance modelling formalism
Performance Evaluation - Modelling techniques and tools for computer performance evaluation
The how and why of interactive Markov chains
FMCO'09 Proceedings of the 8th international conference on Formal methods for components and objects
PETRI NETS'13 Proceedings of the 34th international conference on Application and Theory of Petri Nets and Concurrency
| Hi-index | 0.01 |
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.