Formal techniques for performance analysis: blending SAN and PEPA-Reference-Cited by-同舟云学术

Formal techniques for performance analysis: blending SAN and PEPA

Published:2007-03 Issue:1 Volume:19 Page:3-33
ISSN:0934-5043
Container-title:Formal Aspects of Computing
language:en
Short-container-title:Form. Asp. Comput.

Author:

Hillston Jane¹,Kloul Leïla²

Affiliation:

1. Laboratory for Foundations of Computer Science, School of Informatics, University of Edinburgh, EH9 3JZ, Edinburgh, UK

2. PRiSM, Université de Versailles, 45, Avenue des Etats-Unis, 78035, Versailles Cedex, France

Abstract

Abstract In this paper we consider two performance modelling techniques from the perspectives of model construction, generation of an underlying continuous time Markov process, and the potential for reduction in the Markov process. Such careful comparison of modelling techniques allows us to appreciate the strengths and weaknesses of different approaches, and facilitates cross-fertilization between them. In the present case we take a characteristic of one formalism, functional rates in Stochastic Automata Networks, and introduce it to the other formalism, Performance Evaluation Process Algebra. We investigate the benefits of this cross-fertilization, particularly from the perspectives of Markov process generation and reduction.

Publisher

Association for Computing Machinery (ACM)

Subject

Theoretical Computer Science,Software

Link

http://link.springer.com/content/pdf/10.1007/s00165-006-0011-6.pdf

Reference52 articles.

1. A class of generalized stochastic Petri nets for the performance evaluation of multiprocessor systems

2. Benoit A Brenner L Fernandes P Plateau B Stewart W (2003) The PEPS software tool. In: Proceedings of the 13th international conference on modelling techniques and tools for computer performance evaluation Illinois September 2–7 2003 pp 215–234

3. Benoit A Brenner L Fernandes P Plateau B (2003) Aggregation of stochastic automata networks with replicas. In: Proceedings of the international conference on the numerical solution of markov chains (NSMC’03) Illinois September 2–7 2003 pp 215–234

4. A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A classification and review of timed Markov models of manufacturing systems;Computers & Industrial Engineering;2019-02

2. Marking dependency in non-Markovian stochastic Petri nets;Performance Evaluation;2017-04

3. Modeling reliability of power systems substations by using stochastic automata networks;Reliability Engineering & System Safety;2017-01

4. Challenges for Quantitative Analysis of Collective Adaptive Systems;Trustworthy Global Computing;2014

5. Symbolic Solution of Kronecker-Based Structured Markovian Models;2013 IEEE 21st International Symposium on Modelling, Analysis and Simulation of Computer and Telecommunication Systems;2013-08