Abstract
Recent extensions to process algebras can be used to describe performance or error rate properties of systems. We examine an abstract approach to the representation of time costs within these algebras that permits the efficient calculation of performance bounds on systems. In particular we avoid the ‘state explosion” caused by the parallel composition of the representations of probabilistic time distributions. A major advantage of one of our approaches is its uniformity, which allows the eventual approximation level to be easily predicted from quality of the approximations to the underlying distributions.
This work is supported by an EPSRC Advanced Fellowship.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Bibliography
I. Castellani and M. Hennessey, Distributed Bisimulation, Report Sussex University 5/87, July 1987.
R. van Glabbeek, S. A. Smolka, B. Steffen and C.Tofts, Reactive, Generative and Stratified Models of Probabilistic Processes, proceedings LICS 1990.
H. Hannsson, Time and probability in Formal Design of Distributed Systems PhD Thesis, Department of Computer Systems Uppsala University Uppsala Sweden. TR DoCS 91/27. 1991
M.R. Hansen, Model Checking Discrete Duration Calculus, FACS 6A:826–845, 1994.
J. Hilston, A Compositional Approach to Performance Modelling, PhD Thesis, Department of Computer Science, University of Edinburgh, 1994.
H. Hansson and B. Jonsson, A Logic for Reasoning about Time and Reliability, FACS (6):512–535, 1994.
C. A. R. Hoare, Communicating Sequential Processes, Prentice-Hall 1985.
J. Hilston and F. Moller Proceedings of 1st Conference on Process Algebra and Performance Modelling, Edinburgh Computer Science Departmental Report, 1993
U. Herzog and M. Rettlebach, Proceedings of 2nd Conference on Process Algebra and Performance Modelling, 1994
L. Kleinrock, Queueing Systems, Volumes I and II, John Wiley, 1975.
R. Milner, Calculus of Communicating System, LNCS92, 1980.
R. Milner, Calculi for Synchrony and Asynchrony, Theoretical Computer Science 25(3), pp 267–310, 1983.
R. Milner, Communication and Concurrency, Prentice Hall, 1990.
K. Meinke and J.V. Tucker, Universal Algebra, pp189–411 in Hanbook of Logic in Computer Science, ed S. Abramsky, D. Gabbay and T. S. E. Maibaum, Oxfor University Press, 1991.
K. Nelson, Probability, Stochastic Processes and Queueing Theory, Springer Verlag, 1995.
A. Paz, Introduction to Probabilistic Automata, Academic Press, 1971.
S. Smolka and B. Steffen, Priority as Extremal Probability, Proceedings Concur '90, LNCS 458, 1990.
C. Tofts, A Synchronous Calculus of Relative Frequency, CONCUR '90, Springer Verlag, LNCS 458.
C. Tofts, Exact Solutions to Finite State Simulation Problems, Research Report, Department of Computer Science, University of Calgary, 1993.
C. Tofts, Processes with Probabilities, Priorities and Time, FACS 6(5): 536–564, 1994.
C. Tofts, Exact and Approximate Analytic Solutions of Properties of Probabilistic Processes, Proceedings first TACAS 1995, LNCS 1017.
S. F. M. van Vlijmen, A. van Waveren, An Algebraic Specification of a Model Factory, Research Report, University of Amsterdam Programming Research Group, 1992.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tofts, C. (1997). Compositional performance analysis. In: Brinksma, E. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 1997. Lecture Notes in Computer Science, vol 1217. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0035395
Download citation
DOI: https://doi.org/10.1007/BFb0035395
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62790-6
Online ISBN: 978-3-540-68519-7
eBook Packages: Springer Book Archive