Process algebra for performance evaluation

Abstract

This paper surveys the theoretical developments in the ÿeld of stochastic process algebras, process algebras where action occurrences may be subject to a delay that is determined by a random variable. A huge class of resource-sharing systems -like large-scale computers, clientserver architectures, networks -can accurately be described using such stochastic speciÿcation formalisms. The main emphasis of this paper is the treatment of operational semantics, notions of equivalence, and (sound and complete) axiomatisations of these equivalences for di erent types of Markovian process algebras, where delays are governed by exponential distributions. Starting from a simple actionless algebra for describing time-homogeneous continuous-time Markov chains, we consider the integration of actions and random delays both as a single entity (like in known Markovian process algebras like TIPP, PEPA and EMPA) and as separate entities (like in the timed process algebras timed CSP and TCCS). In total we consider four related calculi and investigate their relationship to existing Markovian process algebras. We also brie y indicate how one can proÿt from the separation of time and actions when incorporating more general, non-Markovian distributions.

A Stochastic Work-Handover Relationship Model in Workflow-supported Social Networks

“…프로세스 마이닝 [2][3][4], 프로세스 시뮬레이션 [5], 프로세스 최적화 [6] 등을 포함해 프로세스의 분석 과정이 동반되는 모든 워 크플로우 연구 분야가 워크플로우 인텔리전스와 밀접하 게 연관되어 있다. 그 중에서 워크플로우의 확률적 모델 링 [7][8][9][10] …”

“…확률적 워크플로우 모델링을 위한 정형 방법에는 SPN(Stochastic Petri Nets) [7], PEPA(Performance Evaluation Process Algebra) [8], SAN(Stochastic Automata Networks) [9], sICN(Stochastic Information Control Net) [ …”

Structural Operational Semantics for Continuous State Probabilistic Processes

“…In recent years, this approach has been applied also to stochastic and probabilistic systems, due to their important applications to performance evaluation, systems biology, etc [19,9,18,15]. Bartels [6] and Klin and Sassone [20] have investigated rule formats (called Probabilistic GSOS and Stochastic GSOS, respectively) which guarantee bisimilarity to be a congruence.…”

The How and Why of Interactive Markov Chains

“…The consideration of stochastic phenomena has led to a plethora of stochastic process calculi, cf. the survey in [36]. One of their semantical models is the topic of this paper: interactive Markov chains (IMCs, for short) [35].…”