Skip to main content
SpringerLink
Log in

A Categorical View of Timed Weak Bisimulation

  • Conference paper
Theory and Applications of Models of Computation (TAMC 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6108))

  • 801 Accesses

Abstract

Timed transition systems are a widely studied model for real-time systems. The intention of the paper is twofold: first to show the applicability of the general categorical framework of open maps in order to prove that timed weak bisimulation is indeed an equivalence relation, and, second, to investigate how several categorical (open maps, path-bisimilarity and coalgebra based) approaches to an abstract characterization of bisimulation relate to each other and to timed weak bisimulation, in the setting of timed transition systems.

This work is supported in part by DFG-RFBR (grant No 436 RUS 113/1002/01, grant No 09-01-91334).

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aczel, P., Mendler, P.F.: A final coalgebra theorem. In: Dybjer, P., Pitts, A.M., Pitt, D.H., Poigné, A., Rydeheard, D.E. (eds.) CTCS 1989. LNCS, vol. 389, pp. 357–365. Springer, Heidelberg (1989)

    Google Scholar 

  2. Alur, R., Courcoubetis, C., Henzinger, T.A.: The observational power of clocks. In: Jonsson, B., Parrow, J. (eds.) CONCUR 1994. LNCS, vol. 836, pp. 162–177. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  3. Andreeva, M.V., Virbitskaite, I.B.: Observational timed equivalences for timed stable event structures. Fundamenta Informaticae 72(4), 1–19 (2006)

    MATH  MathSciNet  Google Scholar 

  4. Baeten, J.C.M., Middelburg, C.A.: Process algebra with timing. EATCS Monograph. Springer, Heidelberg (2002)

    MATH  Google Scholar 

  5. Borceux, F.: Handbook of Categorical Algebra. Encyclopedia of Mathematics and its Applications, vol. 2, 3, 51, 52. Cambridge University Press, Cambridge (1994)

    Google Scholar 

  6. Bihler, E., Vogler, W.: Timed Petri Nets: Efficiency of asynchronous systems. In: Bernardo, M., Corradini, F. (eds.) SFM-RT 2004. LNCS, vol. 3185, pp. 25–58. Springer, Heidelberg (2004)

    Google Scholar 

  7. van Breugel, F., Hermida, C., Makkai, M., Worrell, J.: An accessible approach to behavioural pseudometrics. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1018–1030. Springer, Heidelberg (2005)

    Google Scholar 

  8. Cattani, G.L., Sassone, V.: Higher dimentional transition systems. In: Proc. LICS 1996, pp. 55–62 (1996)

    Google Scholar 

  9. Čerāns, K.: Decidability of bisimulation equivalences for parallel timer processes. In: Probst, D.K., von Bochmann, G. (eds.) CAV 1992. LNCS, vol. 663, pp. 302–315. Springer, Heidelberg (1993)

    Google Scholar 

  10. Chatain, T., Jard, C.: Time supervision of concurrent systems using symbolic unfoldings of time Petri nets. In: Pettersson, P., Yi, W. (eds.) FORMATS 2005. LNCS, vol. 3829, pp. 196–210. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  11. Corradini, A., Grosse-Rhode, M., Heckel, R.: A coalgebraic presentation of structured transition systems. Theoretical Computer Science 260, 27–55 (2002)

    Article  MathSciNet  Google Scholar 

  12. Danos, V., Desharnais, J., Laviolette, F., Panangaden, P.: Bisimulation and cocongruence for probabilistic systems. Information and Computation 204(4), 503–523 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  13. Fokkink, W., Pang, J., Wijs, A.: Is timed branching bisimilarity an equivalence indeed? In: Pettersson, P., Yi, W. (eds.) FORMATS 2005. LNCS, vol. 3829, pp. 258–272. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  14. Gribovskaya, N., Virbitskaite, I.B.: Timed Delay Bisimulation is an Equivalence Relation for Timed Transition Systems. Fundamenta Informaticae 93(1-3), 127–142 (2009)

    MATH  MathSciNet  Google Scholar 

  15. Henzinger, T.A., Majumdar, R., Prabhu, V.S.: Quantifying similarities between timed systems. In: Pettersson, P., Yi, W. (eds.) FORMATS 2005. LNCS, vol. 3829, pp. 226–241. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  16. Hune, T., Nielsen, M.: Bisimulation and open maps for timed transition systems. Fundamenta Informaticae 38, 61–77 (1999)

    MATH  MathSciNet  Google Scholar 

  17. Joyal, A., Nielsen, M., Winskel, G.: Bisimulation from open maps. Information and Computation 127(2), 164–185 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  18. Kick, M., Power, J., Simpson, A.: Coalgebraic semantics for timed processes. Information and Computation 204(4), 588–609 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  19. Klusener, A.S.: The silent step in time. In: Cleaveland, R. (ed.) CONCUR 1992. LNCS, vol. 630. Springer, Heidelberg (1992)

    Chapter  Google Scholar 

  20. Lasota, S.: Coalgebra morphisms subsume open maps. Electronic Notes in Theoretical Computer Science 19 (1999)

    Google Scholar 

  21. Roggenbach, M., Majster-Cederbaum, M.: Towards a unified view of bisimulation: a comparative study. Theoretical Computer Science 238, 81–130 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  22. Monteiro, L.: A Coalgebraic Characterization of Behaviours in the Linear Time – Branching Time Spectrum. In: Corradini, A., Montanari, U. (eds.) WADT 2008. LNCS, vol. 5486, pp. 251–265. Springer, Heidelberg (2008)

    Google Scholar 

  23. Nielsen, M., Cheng, A.: Observing behaviour categorically. In: Thiagarajan, P.S. (ed.) FSTTCS 1995. LNCS, vol. 1026, pp. 263–278. Springer, Heidelberg (1995)

    Google Scholar 

  24. Oshevskaya, E.: Open Maps Bisimulations for Higher Dimensional Automata Models. In: Kutylowski, M., Charatonik, W., Gȩbala, M. (eds.) FCT 2009. LNCS, vol. 5699, pp. 274–286. Springer, Heidelberg (2009)

    Google Scholar 

  25. Rothe, J., Masulovic, D.: Towards weak bisimulation for coalgebras. Electronic Notes in Theoretical Computer Science 68(1) (2002)

    Google Scholar 

  26. Rutten, J.: A note on coinduction and weak bisimilarity for while programs. Informatique Theorique et Applications 33(4/5), 393–400 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  27. Rutten, J.: Universal coalgebra: a theory of systems. Theoretical Computer Science 249(1), 3–80 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  28. Sokolova, A., de Vink, E.P., Woracek, H.: Weak Bisimulation for Action-Type Coalgebras. Electronic Notes in Theoretical Computer Science 122, 211–228 (2005)

    Article  Google Scholar 

  29. Steffen, B., Weise, C.: Deciding testing equivalence for real-time processes with dense time. In: Borzyszkowski, A.M., Sokolowski, S. (eds.) MFCS 1993. LNCS, vol. 711, pp. 703–713. Springer, Heidelberg (1993)

    Google Scholar 

  30. de Vink, E.P., Rutten, J.J.M.M.: Bisimulation for probabilistic transition systems: a coalgebraic approach. Theoretical Computer Science 221, 271–293 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  31. Virbitskaite, I.B., Gribovskaya, N.S.: Open maps and observational equivalences for timed partial order models. Fundamenta Informaticae 60(1-4), 383–399 (2004)

    MATH  MathSciNet  Google Scholar 

  32. van der Zwaag, M.B.: The cones and foci proof technique for timed transition systems. Information Processing Letters 80(1), 33–40 (2001)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. A.P. Ershov Institute of Informatics Systems, SB RAS, 6, Acad. Lavrentiev av., Novosibirsk, 630090, Russia

    Natalya Gribovskaya & Irina Virbitskaite

  2. Novosibirsk State University, 2, Pirogova st., Novosibirsk, 630090, Russia

    Irina Virbitskaite

Authors
  1. Natalya Gribovskaya
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Irina Virbitskaite
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Charles University, Malostranske nam 25, 11800, Praha 1, Czech Republic

    Jan Kratochvíl , Jiří Fiala  & Petr Kolman ,  & 

  2. State Key Lab. of Computer Science, Institute of Software,, Chinese Academy of Sciences, 100190, Beijing, P.R. China

    Angsheng Li

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gribovskaya, N., Virbitskaite, I. (2010). A Categorical View of Timed Weak Bisimulation. In: Kratochvíl, J., Li, A., Fiala, J., Kolman, P. (eds) Theory and Applications of Models of Computation. TAMC 2010. Lecture Notes in Computer Science, vol 6108. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13562-0_40

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13562-0_40

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13561-3

  • Online ISBN: 978-3-642-13562-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation