Abstract
The non-Markovian systems represent almost all stochastic processes, except of a small class having the Markov property; it is a real challenge to analyze these systems. In this article, we present a general method of analyzing non-Markovian systems. The novel viewpoint is given by the use of a compact stochastic process calculus developed in the formal framework of computer science for describing concurrent systems. Since phase-type distributions can approximate non-Markovian systems with arbitrary precision, we approximate a non-Markovian system by describing it easily in our stochastic process calculus, which employs phase-type distributions. The obtained process (in our calculus) are then translated into the probabilistic model checker PRISM; by using this free software tool, we can analyze several quantitative properties of the Markovian approximation of the initial non-Markovian system.
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference32 articles.
1. Milner, R. (1999). Communicating and Mobile Systems: The Pi-Calculus, Cambridge University Press.
2. Norris, J.R. (1998). Markov Chains, Cambridge University Press.
3. A use of complex probabilities in the theory of stochastic processes;Cox;Math. Proc. Camb. Philos. Soc.,2008
4. Nelson, R. (1995). Probability, Stochastic Processes, and Queueing Theory, Springer.
5. PRISM 4.0: Verification of probabilistic real-time systems;Kwiatkowska;Lect. Notes Comput. Sci.,2011
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献