Abstract
This paper surveys and relates the basic concepts of process algebra and the modelling of continuous time Markov chains. It provides basic introductions to both fields, where we also study the Markov chains from an algebraic perspective, viz. that of Markov chain algebra. We then proceed to study the interrelation of reactive processes and Markov chains in this setting, and introduce the algebra of Interactive Markov Chains as an orthogonal extension of both process and Markov chain algebra. We conclude with comparing this approach to related (Markovian) stochastic process algebras by analysing the algebraic principles that they support.
| Original language | English |
|---|---|
| Title of host publication | Lectures on Formal Methods and Performance Analysis |
| Editors | Hendrik Brinksma, H. Hermanns, Joost P. Katoen |
| Place of Publication | Berlin |
| Publisher | Springer |
| Pages | 183-231 |
| Number of pages | 49 |
| ISBN (Electronic) | 978-3-540-44667-5 |
| ISBN (Print) | 978-3-540-42479-6 |
| DOIs | |
| Publication status | Published - Jul 2001 |
Publication series
| Name | Lecture Notes in Computer Science |
|---|---|
| Publisher | Springer Verlag |
| Volume | 2090 |
Keywords
- FMT-PM: PROBABILISTIC METHODS
- EWI-6419
- FMT-PA: PROCESS ALGEBRAS
- IR-63273
- FMT-FMPA: FORMAL METHODS FOR PERFORMANCE ANALYSIS
Fingerprint Dive into the research topics of 'Process Algebra and Markov Chains'. Together they form a unique fingerprint.
Cite this
Brinksma, H., & Hermanns, H. (2001). Process Algebra and Markov Chains. In H. Brinksma, H. Hermanns, & J. P. Katoen (Eds.), Lectures on Formal Methods and Performance Analysis (pp. 183-231). (Lecture Notes in Computer Science; Vol. 2090). Berlin: Springer. https://doi.org/10.1007/3-540-44667-2_5