Revisiting Weak Simulation for Substochastic Markov Chains

  • David N. Jansen
  • Lei Song
  • Lijun Zhang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8054)

Abstract

The spectrum of branching-time relations for probabilistic systems has been investigated thoroughly by Baier, Hermanns, Katoen and Wolf (2003, 2005), including weak simulation for systems involving substochastic distributions. Weak simulation was proven to be sound w.r.t. the liveness fragment of the logic PCTL\(_{\setminus \mathcal{X}}\), and its completeness was conjectured. We revisit this result and show that soundness does not hold in general, but only for Markov chains without divergence. It is refuted for some systems with substochastic distributions. Moreover, we provide a counterexample to completeness. In this paper, we present a novel definition that is sound for live PCTL\(_{\setminus \mathcal{X}}\), and a variant that is both sound and complete.

A long version of this article containing full proofs is available from [11].

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Abadi, M., Lamport, L.: The existence of refinement mappings. Theoretical Computer Science 82(2), 253–284 (1991)MathSciNetMATHCrossRefGoogle Scholar
  2. 2.
    Baier, C., Hermanns, H., Katoen, J.-P., Wolf, V.: Comparative branching-time semantics for Markov chains (extended abstract). In: Amadio, R., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol. 2761, pp. 492–507. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  3. 3.
    Baier, C., Katoen, J.-P.: Principles of model checking. MIT Press, Cambridge (2008)MATHGoogle Scholar
  4. 4.
    Baier, C., Katoen, J.-P., Hermanns, H., Wolf, V.: Comparative branching-time semantics for Markov chains. Information and Computation 200(2), 149–214 (2005)MathSciNetMATHCrossRefGoogle Scholar
  5. 5.
    De Nicola, R., Vaandrager, F.: Three logics for branching bisimulation. Journal of the ACM 42(2), 458–487 (1995)MATHCrossRefGoogle Scholar
  6. 6.
    Deng, Y., van Glabbeek, R., Hennessy, M., Morgan, C.: Testing finitary probabilistic processes, http://www.cse.unsw.edu.au/~rvg/pub/finitary.pdf, an extended abstract has been published as [7]
  7. 7.
    Deng, Y., van Glabbeek, R., Hennessy, M., Morgan, C.: Testing finitary probabilistic processes (extended abstract). In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol. 5710, pp. 274–288. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  8. 8.
    Desharnais, J., Gupta, V., Jagadeesan, R., Panangaden, P.: Approximating labelled Markov processes. Information and Computation 184(1), 160–200 (2003)MathSciNetMATHCrossRefGoogle Scholar
  9. 9.
    Desharnais, J., Laviolette, F., Tracol, M.: Approximate analysis of probabilistic processes: Logic, simulation and games. In: QEST 2008, pp. 264–273. IEEE Computer Society, Los Alamitos (2008)Google Scholar
  10. 10.
    Eisentraut, C., Hermanns, H., Zhang, L.: On probabilistic automata in continuous time. In: 25th Annual IEEE Symposium on Logic in Computer Science: LICS, pp. 342–351. IEEE Computer Society, Los Alamitos (2010)Google Scholar
  11. 11.
    Jansen, D.N., Song, L., Zhang, L.: Revisiting weak simulation for substochastic Markov chains. Tech. Rep. ICIS–R13005, Radboud Universiteit, Nijmegen (2013), http://www.cs.ru.nl/research/reports
  12. 12.
    Jonsson, B., Larsen, K.G.: Specification and refinement of probabilistic processes. In: Sixth Annual IEEE Symposium on Logic in Computer Science (LICS), pp. 266–277. IEEE Computer Society, Los Alamitos (1991)CrossRefGoogle Scholar
  13. 13.
    Sack, J., Zhang, L.: A general framework for probabilistic characterizing formulae. In: Kuncak, V., Rybalchenko, A. (eds.) VMCAI 2012. LNCS, vol. 7148, pp. 396–411. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  14. 14.
    Segala, R.: Modeling and verification of randomized distributed real-time systems. Ph.D. thesis, Massachusetts Institute of Technology, Cambridge (1996)Google Scholar
  15. 15.
    Tarski, A.: A lattice-theoretical fixpoint theorem and its applications. Pacific Journal of Mathematics 5(2), 285–309 (1955)MathSciNetMATHCrossRefGoogle Scholar
  16. 16.
    Zhang, L.: Decision Algorithms for Probabilistic Simulations. Ph.D. thesis, Universität des Saarlandes, Saarbrücken (2008)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • David N. Jansen
    • 1
  • Lei Song
    • 2
    • 5
  • Lijun Zhang
    • 3
    • 4
    • 5
  1. 1.Model-Based System DevelopmentRadboud UniversiteitNijmegenThe Netherlands
  2. 2.Max-Planck-Institut für InformatikSaarbrückenGermany
  3. 3.State Key Laboratory of Computer Science, Institute of SoftwareChinese Academy of SciencesBeijingChina
  4. 4.DTU ComputeTechnical University of DenmarkDenmark
  5. 5.Universität des SaarlandesSaarbrückenGermany

Personalised recommendations