Operational semantics for product-form solution

Authors:
Maria Grazia Vigliotti
Affiliations:
Department of Computing, Imperial College London, London, UK
Venue:
EPEW'12 Proceedings of the 9th European conference on Computer Performance Engineering
Year:
2012

Citing 9
Cited 0

Product form equilibrium distributions and a convolution algorithm for stochastic Petri nets

Performance Evaluation
Product form solution for a class of PEPA models

IPDS '98 Proceedings of the third IEEE international performance and dependability symposium on International performance and dependability symposium
Communicating and mobile systems: the &pgr;-calculus

Communicating and mobile systems: the &pgr;-calculus
A Characterization of Independence for Competing Markov Chains with Applications to Stochastic Petri Nets

IEEE Transactions on Software Engineering
Product Form Solution for Generalized Stochastic Petri Nets

IEEE Transactions on Software Engineering
Product form solution for an insensitive stochastic process algebra structure

Performance Evaluation - Unified specification and performance evaluation using stochastic process algebras
Turning back time in Markovian process algebra

Theoretical Computer Science
Deficiency Zero Petri Nets and Product Form

PETRI NETS '09 Proceedings of the 30th International Conference on Applications and Theory of Petri Nets
A general result for deriving product-form solutions in markovian models

Proceedings of the first joint WOSP/SIPEW international conference on Performance engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present product-form solutions from the point of view of stochastic process algebra. In previous work [16] we have shown how to derive product-form solutions for a formalism called Labelled Markov Automata (LMA). LMA are very useful as their relation with the Continuous Time Markov Chains is very direct. The disadvantage of using LMA is that the proofs of properties are cumbersome. In fact, in LMA it is not possible to use the inductive structure of the language in a proof. In this paper we consider a simple stochastic process algebra that has the great advantage of simplifying the proofs. This simple language has been inspired by PEPA [10], however, detailed analysis of the semantics of cooperation will show the differences between the two formalisms. It will also be shown that the semantics of the cooperation in process algebra influences the correctness of the derivation of the product-form solutions.