A Simple Time Scale Decomposition Technique for Stochastic Process Algebras

  title={A Simple Time Scale Decomposition Technique for Stochastic Process Algebras},
  author={Jane Hillston and Vassilis Mertsiotakis},
  journal={Comput. J.},
Many modern computer and communication systems result in large, complex performance models. The compositional approach offered by stochastic process algebra constructs a model from submodels which are smaller and more easily understood. This gives the model a clear component-based structure. In this paper we present cases when this structure may be used to inform the solution of the model, leading to an efficient solution based on a decomposition of the underlying Markov process. The… 
Throughput approximation of decision free processes using decomposition
  • V. Mersiotakis, M. Silva
  • Computer Science, Mathematics
    Proceedings of the Seventh International Workshop on Petri Nets and Performance Models
  • 1997
The algorithm is using is based on model decomposition at the specification level of stochastic process algebras and has been adopted from marked graphs, a well known sub-class of Petri nets and it works in a divide and conquer fashion.
Compositional solution of stochastic process algebra models
This dissertation is about the solution of Markovian stochastic process algebra (SPA) models and the avoidance of the state-space explosion problem, and considers a true-concurrency semantics for SPA models and investigates its use for an efficient solution of Spa models.
Semi-numerical Solution of Stochastic Process Algebra Models
The state space explosion problem for this class of processes has been solved thanks to the solution method, which is exact and works for a fixed number of sequential processes which all synchronize on the same global set of actions.
Stochastic Process Algebras: a New Approach to Performance Modeling
This chapter presents an introduction to the novel approach to performance modeling provided by Stochastic Process Algebras, and presents several simple examples which illustrate the compositionality which is inherent in the models and can be exploited during their analysis.
A two-level decomposition scheme for Markovian process algebra models
This work proposes a novel approach to solve MPA models which explicitly exploits the concurrent nature of the given model, and derives a novel result on cumulative measures of absorbing joint Markov chains.
Process algebra for performance evaluation
A Syntactical Analysis of Reversible PEPA
Product form solutions have played an important role in the development of performance modelling and in particular in the popularity of queueing network models. The notions of reversibility and
Product form solution for a class of PEPA models
  • J. Hillston, N. Thomas
  • Computer Science
    Proceedings. IEEE International Computer Performance and Dependability Symposium. IPDS'98 (Cat. No.98TB100248)
  • 1998
It is shown that PEPA models that generate such processes may be readily identified and show how the product form solution may be obtained and can be easily generalised to any of the other stochastic process algebra languages.
A fluid model for layered queueing networks
  • M. Tribastone
  • Computer Science
    IEEE Transactions on Software Engineering
  • 2013
This approach significantly improves the quality of the approximation for typical performance indices such as utilization, throughput, and response time and is backed by established theoretical results of asymptotic convergence.


Compositional Markovian Modelling Using a Process Algebra
We introduce a stochastic process algebra, PEPA, as a high-level modelling paradigm for continuous time Markov chains (CTMC). Process algebras are mathematical theories which model concurrent systems
Towards a Product Form Solution for Stochastic Process Algebras
Although the product form criterion derived in this paper is developed in the context of Performance Evaluation Process Algebra, the results can be easily generalised to any of the other stochastic process algebras.
Time Scale Decomposition of a Class of Generalized Stochastic Petri Net Models
A time-scale decomposition (TSD) algorithm of a class of generalized stochastic Petri net (GSPN) models of systems comprising activities whose duration differ by orders of magnitude is presented. The
A comparison of performance evaluation process algebra and generalized stochastic Petri nets
A comparison of the two formalisms in terms of the facilities that they provide to the modeller is presented; considering both the definition and the analysis of the performance model.
Multiprocessor and Distributed System Design: The Integration of Functional Specification and Performance Analysis Using Stochastic Process Algebras
We introduce Stochastic Process Algebras as a novel approach for the structured design and analysis of both the functional behaviour and performance characteristics of parallel and distributed
Performability modeling with UltraSAN
UltraSAN incorporates three innovations: a class of SAN-level performability variables common to both analytical and simulation solution methods, methods that use the performability-variable choice and the SAN structure to greatly reduce the size of the stochastic process required for an analytical solution.
Closed Queuing Systems with Exponential Servers
It is found that the distribution of customers in the closed queuing system is regulated by the stage or stages with the slowest effective service rate, which means that closed systems are shown to be stochastically equivalent to open systems in which the number of customers cannot exceed N.
A compositional approach to performance modelling
Modelling study: multi-server multi-queue systems shows strong equivalence between strong and weak isomorphism and strong bisimilarity.
Aggregation of Variables in Dynamic Systems
In many problems of economic theory, the general Walrasian system and its more modern dynamic extensions are relatively barren of results for macroeconomics and economic policy.
Communication and concurrency
  • R. Milner
  • Computer Science
    PHI Series in computer science
  • 1989
This chapter discusses Bisimulation and Observation Equivalence as a Modelling Communication, a Programming Language, and its application to Equational laws.