Simulation for Interactive Markov Chains

  • Xiying Zhao
  • Lian Li
  • Jinzhao Wu
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4221)


Interactive Markov chains (IMCs) are compositional performance evaluation models which can be used to powerfully model concurrent systems. Simulations that are abstracted from internal computation have been proven to be useful for verification of compositely defined transition system. In the literature of stochastic extension of this transition system, computing simulation preorders are rare. In this paper strong(weak) simulation is introduced for IMCs. The main result of the paper is that we give algorithms to decide strong(weak) simulation preorder for IMCs with a polynomial-time complexity in the number of states of the transition system.


Weight Function Transition System Label Transition System Process Algebra Markovian Transition 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Baier, C., Engelen, B., Majster-Cederbaum, M.: Deciding bisimilarity and similarity for probabilistic process. J. of Comp. and System Sc. 60(1), 187–231 (2000)MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Baier, C., Hermanns, H., Katoen, J.-P., Wolf, V.: Comparative branching-time semantics for Markov chains. In: Amadio, R.M., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol. 2761, pp. 492–507. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  3. 3.
    Baier, C., Hermanns, H.: Weak bisimulation for fully probabilistic system. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol. 1256, pp. 119–130. Springer, Heidelberg (1997)Google Scholar
  4. 4.
    Baier, C., Katoen, J.-P., Hermanns, H., Haverkort, B.: Simulation for continuous-time Markov chains. In: Brim, L., Jančar, P., Křetínský, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol. 2421, pp. 338–354. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  5. 5.
    Baier, C., Haverkort, B.R., Hermanns, H., Katoen, J.-P.: Model-checking algorithms for continuous-time Markov chains. IEEE Trans. Software Eng 29(6), 524–541 (2003)CrossRefGoogle Scholar
  6. 6.
    Baier, C., Haverkort, B.R., Hermanns, H., Katoen, J.-P.: Model checking meets performance evaluation. SIGMETRICS Performance Evaluation Review 32(4), 10–15 (2005)CrossRefGoogle Scholar
  7. 7.
    Bravetti, M.: Revisting interactive Markov chains. In: Vogler, W., Larsen, K.G. (eds.) Models for Time-Critical Systems. BRICS Notes Series NS-02-3, pp. 60–80 (2002)Google Scholar
  8. 8.
    Bolognesi, T., Smolka, S.: Fundamental Results for the Verification of Observational Equivalence: a Survey, Protocl Specification, Testing and Verification, pp. 165–179. Elsevier Science Publishers, Amsterdam (1987)Google Scholar
  9. 9.
    Cleaveland, R., Parrow, J., Steffen, B.: A Semantics-Based Verification Tool for Finite State Systems, Protocl Specification, Testing and Verification IX, pp. 287–302. Elsevier Science Publishers, Amsterdam (1990)Google Scholar
  10. 10.
    Gentilini, R., Piazza, C., Policriti, A.: Simulation as Coarsest Partition Problem. In: Katoen, J.-P., Stevens, P. (eds.) ETAPS 2002 and TACAS 2002. LNCS, vol. 2280, Springer, Heidelberg (2002)CrossRefGoogle Scholar
  11. 11.
    Hermanns, H., Meyer-Kayser, J., Siegle, M.: Multi-terminal binary decision diagrams to represent and analyse continuous-time Markov chains (1999)Google Scholar
  12. 12.
    Hermanns, H.: Interactive Markov chains. PhD thesis, Universität Erlangen-Nürnberg (1998)Google Scholar
  13. 13.
    Hermanns, H., Katoen, J.-P.: Performance evaluation: =(process algebra + model checking ) Markov chains. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol. 2154, pp. 59–81. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  14. 14.
    Hermanns, H., Katoen, J.-P., Meyer-Kayser, J., Siegle, M.: Towards model checking stochastic process algebra. In: IFM 2000. LNCS, vol. 1945, pp. 239–420. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  15. 15.
    Henzinger, M., Henzinger, T., Kopke, P.: Computing Simulations on Finite and Infinite Graphs. In: Proc. FOCS 1995, pp. 43–462 (1995)Google Scholar
  16. 16.
    Jonsson, B.: Simulations between specifications of distributed systems. In: Groote, J.F., Baeten, J.C.M. (eds.) CONCUR 1991. LNCS, vol. 527, pp. 346–360. Springer, Heidelberg (1991)Google Scholar
  17. 17.
    Jensen, A.: Markov chains as an aid in the study of Markov process. Skand. Aktuarietidskrift 3, 87–91 (1953)Google Scholar
  18. 18.
    Kannelakis, P., Smolka, S.: CCS Expressions, Finite State Processes and Three Problems of Equivalenec. In: Kannelakis, P., Smolka, S. (eds.) Proc. 2nd ACM Symposium on the Pronciples of Distributed Computating, pp. 228–240 (1983)Google Scholar
  19. 19.
    Larsen, K.G., Skou, A.: Bisimulation through probabilistic testing. Inf. and Comp. 94(1), 1–28 (1992)CrossRefMathSciNetGoogle Scholar
  20. 20.
    Milner, R.: Communication and Concurrency. Prentice Hall, Englewood Cliffs (1989)MATHGoogle Scholar
  21. 21.
    Philippou, A., Lee, I., Sokolsky, O.: Weak bisimulation for probabilistic systems. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, pp. 334–349. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  22. 22.
    Paige, R., Tarjan, R.: Three Partition Refinement Algorithms. SIAM Journal of Computing 16(6), 973–989 (1987)MATHCrossRefMathSciNetGoogle Scholar
  23. 23.
    Qin, G., Wu, J.: Branching time equivlences for interactive Markov chains. In: Núñez, M., Maamar, Z., Pelayo, F.L., Pousttchi, K., Rubio, F. (eds.) FORTE 2004. LNCS, vol. 3236, pp. 156–169. Springer, Heidelberg (2004)Google Scholar
  24. 24.
    Segala., R., Lynch, N.: Probabilistic Simulations for Probabilistic Processes. In: Jonsson, B., Parrow, J. (eds.) CONCUR 1994. LNCS, vol. 836, pp. 492–493. Springer, Heidelberg (1994)Google Scholar
  25. 25.
    Tan, L., Cleaveland, R.: Simulation revisited. In: Margaria, T., Yi, W. (eds.) ETAPS 2001 and TACAS 2001. LNCS, vol. 2031, pp. 480–495. Springer, Heidelberg (2001)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Xiying Zhao
    • 1
  • Lian Li
    • 1
  • Jinzhao Wu
    • 1
    • 2
  1. 1.The Information Engineering College of Lanzhou UniversityLanzhouChina
  2. 2.Chinese Academy of SciencesChengdu Institute of Computer ApplicationsChengduChina

Personalised recommendations