Abstract
We present a simple method to associate rewards with terms of the stochastic process algebra EMPA in order to make the specification and the computation of performance measures easier. The basic idea behind this method is to specify rewards within actions of EMPA terms, so it substantially differs from methods based on modal logic. The main motivations of this method are its ease of use as well as the possibility of defining a notion of equivalence which relates terms having the same reward, thus allowing for simplification without altering the performance index. We prove that such an equivalence is a congruence finer than the strong extended Markovian bisimulation equivalence, and we present its axiomatization.
Preview
Unable to display preview. Download preview PDF.
References
M. Bernardo, R. Gorrieri, “Extended Markovian Process Algebra”, in Proc. of the 7th Int. Conf. on Concurrency Theory (CONCUR '96), LNCS 1119:315–330, Pisa (Italy), 1996
M. Bernardo, R. Gorrieri, “A Tutorial on EMPA: A Theory of Concurrent Processes with Nondeterminism, Priorities, Probabilities and Time”, Technical Report UBLCS-96-17, University of Bologna (Italy), 1996
G. Clark, “Formalising the Specification of Rewards with PEPA”, in Proc. of the 4th Workshop on Process Algebras and Performance Modelling (PAPM '96), GLUT, pp. 139–160, Torino (Italy), 1996
M. Hennessy, R. Milner, “Algebraic Laws for Nondeterminism and Concurrency”, in Journal of the ACM 32:137–161, 1985
J. Hillston, “A Compositional Approach to Performance Modelling”, Cambridge University Press, 1996
R.A. Howard, “Dynamic Probabilistic Systems”, John Wiley&Sons, 1971
L. Kleinrock, “Queueing Systems”, John Wiley&Sons, 1975
K.G. Larsen, A. Skou, “Bisimulation through Probabilistic Testing”, in Information and Computation 94(1):1–28, 1991
C.A. Vissers, G. Scollo, M. van Sinderen, E. Brinksma, “Specification Styles in Distributed Systems Design and Verification”, in Theoretical Computer Science 89:179–206, 1991
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bernardo, M. (1997). An algebra-based method to associate rewards with EMPA terms. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds) Automata, Languages and Programming. ICALP 1997. Lecture Notes in Computer Science, vol 1256. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63165-8_192
Download citation
DOI: https://doi.org/10.1007/3-540-63165-8_192
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63165-1
Online ISBN: 978-3-540-69194-5
eBook Packages: Springer Book Archive