Abstract
Probabilistic model checking enjoys a rapid increase of interest from different communities. Software tools such as PRISM [13] (with about 4,000 downloads), MRMC [12], and LiQuor [2] support the verification of Markov chains or variants thereof that exhibit nondeterminism. They have been applied to case studies from areas such as randomised distributed algorithms, planning and AI, security, communication protocols, biological process modeling, and quantum computing. Probabilistic model checking engines have been integrated in existing tool chains for widely used formalisms such as stochastic Petri nets [6], Statemate [5], and the stochastic process algebra PEPA [11], and are used for a probabilistic extension of Promela [2].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Aziz, A., Sanwal, K., Singhal, V., Brayton, R.: Model-checking continuous time Markov chains. ACM TOCL 1, 162–170 (2000)
Baier, C., Ciesinski, F., Größer, M.: ProbMela and verification of Markov decision processes. Performance Evaluation Review 32, 22–27 (2005)
Baier, C., Haverkort, B., Hermanns, H., Katoen, J.-P.: Model-checking algorithms for continuous-time Markov chains. IEEE TSE 29, 524–541 (2003)
Baier, C., Katoen, J.-P., Hermanns, H., Wolf, V.: Comparative branching-time semantics for Markov chains. Information and Computation 200, 149–214 (2005)
Böde, E., Herbstritt, M., Hermanns, H., Johr, S., Peikenkamp, T., Pulungan, R., Wimmer, R., Becker, B.: Compositional performability evaluation for Statemate. In: QEST, pp. 167–178. IEEE CS, Los Alamitos (2006)
D’Aprile, D., Donatelli, S., Sproston, J.: CSL model checking for the GreatSPN tool. In: Aykanat, C., Dayar, T., Körpeoğlu, İ. (eds.) ISCIS 2004. LNCS, vol. 3280, pp. 543–553. Springer, Heidelberg (2004)
Derisavi, S., Hermanns, H., Sanders, W.H.: Optimal state-space lumping in Markov chains. IPL 87, 309–315 (2003)
Groesser, M., Baier, C.: Partial order reduction for Markov decision processes: a survey. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.) FMCO 2005. LNCS, vol. 4111, pp. 408–427. Springer, Heidelberg (2006)
Hansson, H., Jonsson, B.: A logic for reasoning about time and reliability. Formal Aspects of Computing 6, 512–535 (1994)
Hermanns, H., Kwiatkowska, M., Norman, G., Parker, D., Siegle, M.: On the use of MTBDDs for performability analysis and verification of stochastic systems. J. of Logic and Alg. Progr. 56, 23–67 (2003)
Hillston, J.: A Compositional Approach to Performance Modelling. Cambridge University Press, Cambridge (1996)
Katoen, J.-P., Khattri, M., Zapreev, I.S.: A Markov reward model checker. In: QEST, pp. 243–244. IEEE CS, Los Alamitos (2005)
Kwiatkowska, M., Norman, G., Parker, D.: Probabilistic symbolic model checking with PRISM: a hybrid approach. Int. J. on STTT 6, 128–142 (2004)
Monniaux, D.: Abstract interpretation of programs as Markov decision processes. Science of Computer Programming 58, 179–205 (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Katoen, JP. (2007). Abstraction of Probabilistic Systems. In: Raskin, JF., Thiagarajan, P.S. (eds) Formal Modeling and Analysis of Timed Systems. FORMATS 2007. Lecture Notes in Computer Science, vol 4763. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75454-1_1
Download citation
DOI: https://doi.org/10.1007/978-3-540-75454-1_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75453-4
Online ISBN: 978-3-540-75454-1
eBook Packages: Computer ScienceComputer Science (R0)