Skip to main content
SpringerLink
Log in

The Infinite Evolution Mechanism of ϵ-Bisimilarity

  • Regular Paper
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

In this paper, we focus on the convergence mechanism of ϵ-bisimulation under probabilistic processes to discuss the dynamic correctness of the software. Firstly, ϵ-limit bisimulation is defined for reflecting the dynamic relation between software specification and implementation. Some special ϵ-limit bisimulations are showed. Secondly, ϵ-bisimulation limit is proposed, which states the specification is the limit of implementation under ϵ-bisimulation. The uniqueness of ϵ-bisimulation limit and consistence with ϵ-bisimulation are presented. Finally, the substitutivity laws of ϵ-bisimulation limit with various combinators are proved.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Baeten J C, Weijland W P. Process Algebra. New York, USA: Cambridge University Press, 1990.

    Book  Google Scholar 

  2. Hoare C A R. Communicating sequential processes. Communications of the ACM, 1978, 21(8): 666–677.

    Article  MATH  MathSciNet  Google Scholar 

  3. Hoare C A R. Communicating Sequential Processes. New Jersey, USA: Prentice Hall, 1985.

    MATH  Google Scholar 

  4. Milner R. Communication and Concurrency. New Jersey, USA: Prentice-Hall, 1989.

    MATH  Google Scholar 

  5. Ying M S, Wirshing M. Approximate bisimilarity. In Proc. the 8th International Conference of Algebraic Methodology and Software Technology, May 2000, pp.309-322.

  6. Ying M S. Bisimulation indexes and their applications. Theoretical Computer Science, 2002, 275(1/2): 1–68.

    Article  MATH  MathSciNet  Google Scholar 

  7. Ying M S. Topology in Process Calculus: Approximate Correctness and Infinite Evolution of Concurrency Programs. New York: Springer-Verlag, 2001.

    Book  Google Scholar 

  8. Segala R, Lynch N. Probabilistic simulations for probabilistic processes. In Proc. the 5th International Conference on Concurrency Theory, August 1994, pp.481-496.

  9. Deng Y X, van Glabbeek R, Hennessy M, Morgan C. Testing finitary probabilistic processes. In Proc. the 20th International Conference on Concurrency Theory, September 2009, pp.274-288.

  10. Song L, Deng Y X,Cai X J. Towards automatic measurement of probabilistic processes. In Proc. the 7th International Conference on Quality Software, Oct. 2007, pp.50-59.

  11. van Glabbeek R J, Smolka S A, Steffen B. Reactive, generative, and stratified models of probabilistic processes. Infromation and Computation, 1995, 121(1): 59–80.

    Article  MATH  Google Scholar 

  12. Larsen K G, Skou A. Bisimulation through probabilistic testing. Information and Computation, 1991, 94(1): 1–28.

    Article  MATH  MathSciNet  Google Scholar 

  13. Larsen K G, Skou A. Compositional verification of probabilistic processes. In Proc. the 3rd International Conference on Concurrency Theory, August 1992, pp.456-471.

  14. Giacalone A, Jou C C, Smolka S A. Algebraic reasoning for probabilistic concurrent systems. In Proc. IFIP TC2 Working Conference on Programming Concepts and Methods, April 1990, pp.443-458.

  15. Smolka S A, Steffen B. Priority as extremal probability. In Proc. Theories of Concurrency: Unification and Extension, August 1990, pp.456-466.

  16. Milner R. Calculi for synchrony and asynchrony. Theoretical Computer Science, 1983, 25(3): 267–310.

    Article  MATH  MathSciNet  Google Scholar 

  17. Ying M S. Additive models of probabilistic processes. Theoretical Computer Science, 2002, 275(1/2): 481–519.

    Article  MATH  MathSciNet  Google Scholar 

  18. Ma Y F, Zhang M, Chen L. The infinite evolution mechanism of ϵ-bisimulation. In Proc. the 3rd International Conference on Quantitative Logic and Soft Computing, May 2012, pp.252-259.

  19. Engelking R. General Topology. Polish Science, 1977.

  20. Kelly J L. General Topology. Springer-Verlag, 1975.

Download references

Author information

Authors and Affiliations

  1. School of Computer Science and Technology, Huaibei Normal University, Huaibei, 235000, China

    Yan-Fang Ma

  2. Shanghai Key Laboratory of Trustworthy Computing, East China Normal University, Shanghai, 200062, China

    Min Zhang

Authors
  1. Yan-Fang Ma
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Min Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Min Zhang.

Additional information

This work is supported by the National Natural Science Foundation of China under Grant Nos. 61021004, 61202105, 61300048, the Natural Science Foundation of Anhui Province of China under Grant No. 1308085QF117, the Natural Science Foundation of Universities of Anhui Province of China under Grant No. KJ2011A248, and the Open Fund of Shanghai Key Laboratory of Trustworthy Computing of China.

The preliminary version of this paper was published in the Proceedings of the 3rd QL&SC.

Electronic supplementary material

Below is the link to the electronic supplementary material.

ESM 1

(DOC 29 kb)

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ma, YF., Zhang, M. The Infinite Evolution Mechanism of ϵ-Bisimilarity. J. Comput. Sci. Technol. 28, 1097–1105 (2013). https://doi.org/10.1007/s11390-013-1400-y

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11390-013-1400-y

Keywords

Search

Navigation