Lumping and Reversed Processes in Cooperating Automata
- 631 Downloads
Performance evaluation of computer software or hardware architectures may rely on the analysis of a complex stochastic model whose specification is usually given in terms of a high level formalism such as queueing networks, stochastic Petri nets, stochastic Automata or Markovian process algebras. Compositionality is a key-feature of many of these formalisms and allows the modeller to combine several (simple) components to form a complex architecture. However, although these formalisms allow for relative compact specifications of possibly complex models, the derivation of the interested performance indices may be very time and space consuming since the set of possible states of the model tends to grow exponentially with the number of components.
In this paper we focus on models with underlying continuous time Markov chains and we show sufficient conditions under which exact lumping of the forward or the reversed process can be derived, allowing the exact computation of marginal stationary probabilities of the cooperating components. The peculiarity of our method relies on the fact that lumping is applied at component-level rather than to the CTMC of the joint process, thus reducing both the memory requirement and the computational cost of the subsequent solution of the model.
KeywordsMarkov Chain Marginal Distribution Negative Customer Stochastic Automaton High Level Formalism
Unable to display preview. Download preview PDF.
- 3.Buchholz, P.: Bounding stationary results of tandem networks with MAP input and MAP service time distributions. In: Proc. of ACM SIGMETRICS/PERFORMANCE, Saint Malo, FR, pp. 191–202 (2006)Google Scholar
- 9.Fourneau, J.M., Plateau, B., Stewart, W.J.: Product form for stochastic automata networks. In: ValueTools 2007: Proc. of the 2nd International Conference on Performance Evaluation Methodologies and Tools, pp. 1–10. ICST, Brussels (2007)Google Scholar
- 12.Gilmore, S., Hillston, J.: The PEPA Workbench: A Tool to Support a Process Algebra Based Approach to Performance Modelling. In: Haring, G., Kotsis, G. (eds.) TOOLS 1994. LNCS, vol. 794, pp. 353–368. Springer, Heidelberg (1994)Google Scholar
- 16.Hillston, J.: A Compositional Approach to Performance Modelling. Ph.D. thesis, Department of Computer Science, University of Edinburgh (1994)Google Scholar
- 18.Kemeny, J.G., Snell, J.L.: Finite Markov Chains, ch. II. D. Van Nostrand Company, Inc. (1960)Google Scholar