Phase-type approximations for non-markovian systems: A case study

2Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Non-Markovian systems are usually difficult to represent and analyse using currently available stochastic process calculi. By relying on a combination between the newly introduced process algebra PHASE and the probabilistic model checker PRISM, we examine the dynamics of one such system, which involves a collaborative text review performed by two manuscript editors, and focus on the derivation of quantitative performance measures.We find that approximating non-Markovian transitions through single Markovian transitions is fast, but inaccurate, while employing more complex phase-type approximations is somewhat slow, but considerably more precise.

Cite

CITATION STYLE

APA

Ciobanu, G., & Rotaru, A. (2015). Phase-type approximations for non-markovian systems: A case study. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8938, pp. 323–334). Springer Verlag. https://doi.org/10.1007/978-3-319-15201-1_21

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free