Bisimulation Proof Methods in a Path-Based Specification Language for Polynomial Coalgebras

  • Xiao-cong Zhou
  • Yong-ji Li
  • Wen-jun Li
  • Hai-yan Qiao
  • Zhong-mei Shu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6461)


Bisimulation is one of the fundamental concepts of the theory of coalgebras. However, it is difficult to verify whether a relation is a bisimulation. Although some categorical bisimulation proof methods for coalgebras have been proposed, they are not based on specification languages of coalgebras so that they are difficult to be used in practice. In this paper, a specification language based on paths of polynomial functors is proposed to specify polynomial coalgebras. Since bisimulation can be defined by paths, it is easy to transform Sangiorgi’s bisimulation proof methods for labeled transition systems to reasoning rules in such a path-based specification language for polynomial coalgebras. The paper defines the notions of progressions and sound functions based on paths, then introduces the notion of faithful contexts for the language and presents a bisimulation-up-to context proof technique for polynomial coalgebras. Several examples are given to illustrate how to make use of the bisimulation proof methods in the language.


Modal Logic Function Symbol Partial Function State Term Label Transition System 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Rutten, J.: Universal coalgebra: A theory of systems. TCS 249(1), 3–80 (2000)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Sangiorgi, D.: On the origins of bisimulation and coinduction. TOPLAS, Articale 15 31(4) (2009)Google Scholar
  3. 3.
    Sangiorgi, D.: On the bisimulation proof method. Mathematical Structures in Computer Science 8, 447–479 (1998)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Sangiorgi, D., Walker, D.: The pi-calculus: a Theory of Mobile Processes. Cambridge University Press, Cambridge (2001)zbMATHGoogle Scholar
  5. 5.
    Rothe, J., Tews, H., Jacobs, B.: The coalgebraic class specification language CCSL. Journal of Universal Computer Science 7(2), 175–193 (2001)MathSciNetzbMATHGoogle Scholar
  6. 6.
    Cîrstea, C.: Integrating Observatins and Computations in the Specification of State-based, Dynamical Systems. PhD thesis, University of Oxford (2000)Google Scholar
  7. 7.
    Kurz, A.: Specifying coalgebras with modal logic. TCS 260(1-2), 119–138 (2001)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Rößiger, M.: From modal logic to terminal coalgebras. TCS 260, 209–228 (2001)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Goldblatt, R.: Equational logic of polynomial coalgebras. In: Balbiani, P., Suzuki, N.-Y., Wolter, F., Zakharyaschev, M. (eds.) Advances in Modal Logic, vol. 4, pp. 149–184. King’s College Publications (2003)Google Scholar
  10. 10.
    Bonsangue, M., Rutten, J., Silva, A.: Regular expressons for polynomial coalgebras. CWI Report SEN-E0703 (2007)Google Scholar
  11. 11.
    Bonsangue, M., Rutten, J., Silva, A.: An algebra for Kripke polynomial coalgebras. In: 24th Annual IEEE Symposium on Logic in Computer Science, pp. 49–58. IEEE Press, Los Alamitos (2009)Google Scholar
  12. 12.
    Jacobs, B.: Towards a duality result in coalgebraic modal logic. ENTCS 33 (2000)Google Scholar
  13. 13.
    Goldblatt, R.: A calculus of terms for coalgebras of polynomial functors. ENTCS 44, 161–184 (2001)zbMATHGoogle Scholar
  14. 14.
    Rößiger, M.: Languages for coalgebras on datafunctors. ENTCS 19, 39–60 (1999)MathSciNetzbMATHGoogle Scholar
  15. 15.
    Jacobs, B.: The temporal logic of coalgebras via galois algebras. Technical Report CSI-R9906, Computer Science Institution, University of Nijmegen (1999)Google Scholar
  16. 16.
    Rutten, J.: Elements of stream calculus (an extensive exercise in coinduction). ENTCS 45, 1–66 (2001)zbMATHGoogle Scholar
  17. 17.
    Jacobs, B.: Exercises in coalgebraic specification. In: Backhouse, R., Crole, R., Gibbons, J. (eds.) Algebraic and Coalgebraic Methods in the Mathematics of Program Construction. LNCS, vol. 2297, pp. 237–280. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  18. 18.
    Moss, L.: Coalgebraic logic. APAL 96(1-3), 277–317 (1999)MathSciNetzbMATHGoogle Scholar
  19. 19.
    Jacobs, B.: Many-sorted coalgeraic modal logic: a model-theoretical study. ITA 35(1), 31–59 (2001)zbMATHGoogle Scholar
  20. 20.
    Pattinson, D.: Coalgebraic modal logic: soundness, completeness and decidability of local consequence. TCS 309(1-3), 177–193 (2003)MathSciNetCrossRefzbMATHGoogle Scholar
  21. 21.
    Lenisa, M.: From set-theoretic coinduction to coalgebraic coinduction: some resuults, some problems. ENTCS 19, 1–21 (1999)MathSciNetzbMATHGoogle Scholar
  22. 22.
    Bartels, F.: Generalised coinduction. Mathematical Structures in Computer Science 13, 321–348 (2003)MathSciNetCrossRefzbMATHGoogle Scholar
  23. 23.
    Lingyun, L.: An effective coalgebraic bisimulation proof method. ENTCS 164, 105–119 (2006)MathSciNetzbMATHGoogle Scholar
  24. 24.
    Jacobs, B.: Introduction to Coalgebra: Towards Mathematics of States and Observations. Book Draft (2005),

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Xiao-cong Zhou
    • 1
  • Yong-ji Li
    • 1
  • Wen-jun Li
    • 1
  • Hai-yan Qiao
    • 1
  • Zhong-mei Shu
    • 1
  1. 1.Sun Yat-sen UniversityGuangzhouP.R. China

Personalised recommendations