Abstract
In this paper, we consider a problem of reduction of probabilistic transition systems (PTS) in order to reduce the complexity of model checking of such systems. The problem of model checking of a PTS is to calculate truth values of formulas of the probabilistic temporal logic PCTL in an initial state of the PTS. We introduce the concept of equivalence of states of a PTS and present an algorithm for removing equivalent states. A result of this algorithm is a PTS such that all of its properties expressed by formulas of PCTL coincide with those of the original PTS.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
L. de Alfaro, M. Kwiatkowska, G. Norman, D. Parker, and R. Segala, “Symbolic model checking of probabilistic processes using MTBDDs and the Kronecker representation,” in: S. Graf and M. Schwartzbach, eds., Proc. 6th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS’00 ), Lect. Notes Comput. Sci., Vol. 1785, Springer, Berlin (2000), pp. 395–410.
P. D’Argenio and P. Niebert, “Partial order reduction on concurrent probabilistic programs,” in: Proc. 1st Int. Conf. on Quantitative Evaluation of Systems (QEST’04), IEEE CS Press (2004), pp. 240–249.
C. Baier, E. Clarke, V. Hartonas-Garmhausen, M. Kwiatkowska, and M. Ryan, “Symbolic model checking for probabilistic processes,” in P. Degano, R. Gorrieri, and A. Marchetti-Spaccamela, eds., Proc. 24th Int. Colloq. on Automata, Languages and Programming (ICALP’97), Lect. Notes Comput. Sci., Vol. 1256, Springer, Berlin (1997), pp. 430–440.
C. Baier, M. Grösser, and F. Ciesinski, “Partial order reduction for probabilistic systems,” in: Proc. 1st Int. Conf. on Quantitative Evaluation of Systems (QEST’04), IEEE Comput. Soc. Press (2004), pp. 230–239.
C. Baier, B. Haverkort, H. Hermanns, and J.-P. Katoen, “Model-checking algorithms for continuous-time Markov chains,” IEEE Trans. Software Eng., 29, No. 6, 524–541 (2003).
A. Bianco and L. de Alfaro, “Model checking of probabilistic and nondeterministic systems,” in: P. Thiagarajan, ed., Proc. 15th Conf. on Foundations of Software Technology and Theoretical Computer Science (FSTTCS’95), Lect. Notes Comput. Sci., Vol. 1026, Springer, Berlin (1995), 499–513.
J. W. Carlyle, “Reduced forms for stochastic sequential machines,” J. Math. Anal. Appl., 7, 167–175 (1963).
E. M. Clarke, Jr., O. Grumberg, and D. A. Peled, Model Checking, MIT Press (1999).
C. Courcoubetis and M. Yannakakis, “Verifying temporal properties of finite state probabilistic programs,” in: Proc. 29th Annual Symp. on Foundations of Computer Science (FOCS’88 ), IEEE Comput. Soc. Press (1988), pp. 338–345.
A. Donaldson and A. Miller, “Symmetry reduction for probabilistic model checking using generic representatives,” in: S. Graf and W. Zhang, eds., Proc. 4th Int. Symp. Automated Technology for Verification and Analysis (ATVA’06 ), Lect. Notes Comput. Sci., Vol. 4218, Springer, Berlin (2006), pp. 9–23.
H. Hansson, Time and Probability in Formal Design of Distributed Systems, Elsevier, Amsterdam (1994).
H. Hansson and B. Jonsson, “A logic for reasoning about time and reliability,” Formal Aspects Comput., 6, No. 5, 512–535 (1994).
S. Hart, M. Sharir, and A. Pnueli, “Termination of probabilistic concurrent programs,” ACM Trans. Program. Lang. Syst., 5, No. 3, 356–380 (1983).
H. Hermanns, J.-P. Katoen, J. Meyer-Kayser, and M. Siegle, “A Markov chain model checker,” in: S. Graf and M. Schwartzbach, eds., Proc. 6th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS’00 ), Lect. Notes Comput. Sci., Vol. 1785, Springer, Berlin (2000), pp. 347–362.
J. G. Kemeny and J. L. Snell, Finite Markov Chains, Springer, Berlin (1983).
M. Kwiatkowska, G. Norman, and D. Parker, “Probabilistic model checking in practice: Case studies with PRISM,” ACM SIGMETRICS Perform. Evaluation Rev., 32, No. 4, 16–21 (2005).
M. Kwiatkowska, G. Norman, and D. Parker, “Symmetry reduction for probabilistic model checking,” in: T. Ball and R. Jones, eds., Proc. 18th Int. Conf. on Computer Aided Verification (CAV’06 ), Lect. Notes Comput. Sci., Vol. 4114, Springer, Berlin (2006), pp. 234–248.
M. Kwiatkowska, G. Norman, and D. Parker, “PRISM 4.0: Verification of probabilistic real-time systems,” in: G. Gopalakrishnan and S. Qadeer, eds., Proc. 23rd Int. Conf. on Computer Aided Verification (CAV’11 ), Lect. Notes Comput. Sci., Vol. 6806, Springer, Berlin (2011), pp. 585–591.
M. Kwiatkowska and D. Parker, Advances in Probabilistic Model Checking, http://qav.comlab.ox.ac.uk/papers/marktoberdorf11.pdf.
A. Paz, Introduction to Probabilistic Automata, Academic Press, London (1971).
M. Vardi, “Automatic verification of probabilistic concurrent finite state programs,” in: Proc. 26th Annual Symp. on Foundations of Computer Science (FOCS’85 ), IEEE Comput. Soc. Press (1985), pp. 327–338.
Author information
Authors and Affiliations
Corresponding author
Additional information
Translated from Fundamentalnaya i Prikladnaya Matematika, Vol. 19, No. 1, pp. 121–163, 2014.
Rights and permissions
About this article
Cite this article
Mironov, A.M., Frenkel, S.L. Minimization of Probabilistic Models of Programs. J Math Sci 211, 381–412 (2015). https://doi.org/10.1007/s10958-015-2611-2
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10958-015-2611-2