STOCHASTIC-PROCESS ALGEBRAS - BETWEEN LOTOS AND MARKOV-CHAINS

Citation
H. Hermanns et al., STOCHASTIC-PROCESS ALGEBRAS - BETWEEN LOTOS AND MARKOV-CHAINS, Computer networks and ISDN systems, 30(9-10), 1998, pp. 901-924
Citations number
74
Categorie Soggetti
Computer Science Information Systems",Telecommunications,"Engineering, Eletrical & Electronic","Computer Science Information Systems
ISSN journal
01697552
Volume
30
Issue
9-10
Year of publication
1998
Pages
901 - 924
Database
ISI
SICI code
0169-7552(1998)30:9-10<901:SA-BLA>2.0.ZU;2-X
Abstract
This paper introduces stochastic process algebras as an approach for t he structured design and analysis of both the functional behavior and performance characteristics of parallel and distributed systems. This is achieved by integrating stochastic modelling and analysis into proc ess algebras like CCS or LOTOS. We demonstrate how notions of equivale nt behavior - substantial for process algebras - stand in a new light for stochastic process algebras. In particular we discuss the impact o f stochastic versions of such equivalences on compositional performanc e analysis by means of a running example. In addition we discuss analy sis techniques, tool support and include a survey of related work as w ell as recent trends in this area. (C) 1998 Elsevier Science B.V. All rights reserved.