Skip to main content

Advertisement

SpringerLink
Log in
Menu
Find a journal Publish with us
Search
Cart
Book cover

IFIP International Conference on Theoretical Computer Science

TCS 2012: Theoretical Computer Science pp 87–103Cite as

  1. Home
  2. Theoretical Computer Science
  3. Conference paper
Weak Bisimulations for Coalgebras over Ordered Functors

Weak Bisimulations for Coalgebras over Ordered Functors

  • Tomasz Brengos18 
  • Conference paper
  • 790 Accesses

  • 2 Citations

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

Abstract

The aim of this paper is to introduce a coalgebraic setting in which it is possible to generalize and compare the two known approaches to defining weak bisimulation for labelled transition systems. We introduce two definitions of weak bisimulation for coalgebras over ordered functors, show their properties and give sufficient conditions for them to coincide. We formulate a weak coinduction principle.

Keywords

  • coalgebra
  • bisimulation
  • saturator
  • weak bisimulation
  • weak coinduction

Download conference paper PDF

References

  1. Baier, C., Hermanns, H.: Weak Bisimulation for Fully Probabilistic Processes. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol. 1254, pp. 119–130. Springer, Heidelberg (1997)

    CrossRef  Google Scholar 

  2. Gumm, H.P.: Elements of the general theory of coalgebras. In: LUATCS 1999, Rand Afrikaans University, Johannesburg (1999)

    Google Scholar 

  3. Hughes, J., Jacobs, B.: Simulations in coalgebra. TCS 327(1-2), 71–108 (2004)

    CrossRef  MathSciNet  MATH  Google Scholar 

  4. Milner, R.: A Calculus of Communication Systems. LNCS, vol. 92. Springer, Heidelberg (1980)

    CrossRef  Google Scholar 

  5. Rothe, J.: A syntactical approach to weak (bi)-simulation for coalgebras. In: Moss, L. (ed.) Proc. CMCS 2002. ENTCS, vol. 65, pp. 270–285 (2002)

    Google Scholar 

  6. Rothe, J., Masulović, D.: Towards weak bisimulation for coalgebras. In: Proc. Categorical Methods for Concurrency, Interaction and Mobility. ENTCS, vol. 68(1), pp. 32–46 (2002)

    Google Scholar 

  7. Segala, R., Lynch, N.: Probabilistic Simulations for Probabilistic Processes. In: Jonsson, B., Parrow, J. (eds.) CONCUR 1994. LNCS, vol. 836, pp. 481–496. Springer, Heidelberg (1994)

    CrossRef  Google Scholar 

  8. Segala, R.: Modeling and verification of randomized distributed real-time systems. Ph.D. thesis. MIT (1995)

    Google Scholar 

  9. Sokolova, A., de Vink, E., Woracek, H.: Coalgebraic Weak Bisimulation for Action-Type Systems. Sci. Ann. Comp. Sci. 19, 93–144 (2009)

    Google Scholar 

  10. Rutten, J.J.M.M.: A note on coinduction and weak bisimilarity for while programs. Theoretical Informatics and Applications (RAIRO) 33, 393–400 (1999)

    CrossRef  MathSciNet  MATH  Google Scholar 

  11. Rutten, J.J.M.M.: Universal coalgebra: a theory of systems. TCS 249(1), 3–80 (2000)

    CrossRef  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mathematics and Information Sciences, Warsaw University of Technology, Koszykowa 75, 00-662, Warszawa, Poland

    Tomasz Brengos

Authors
  1. Tomasz Brengos
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Centrum Wiskunde & Informatica (CWI), Science Park 123, 1098 XG, Amsterdam, The Netherlands

    Jos C. M. Baeten & Frank S. de Boer & 

  2. Microsoft Research, One Microsoft Way, 98052, Redmond, WA, USA

    Tom Ball

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 IFIP International Federation for Information Processing

About this paper

Cite this paper

Brengos, T. (2012). Weak Bisimulations for Coalgebras over Ordered Functors. In: Baeten, J.C.M., Ball, T., de Boer, F.S. (eds) Theoretical Computer Science. TCS 2012. Lecture Notes in Computer Science, vol 7604. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33475-7_7

Download citation

  • .RIS
  • .ENW
  • .BIB
  • DOI: https://doi.org/10.1007/978-3-642-33475-7_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-33474-0

  • Online ISBN: 978-3-642-33475-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Share this paper

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

Search

Navigation

  • Find a journal
  • Publish with us

Discover content

  • Journals A-Z
  • Books A-Z

Publish with us

  • Publish your research
  • Open access publishing

Products and services

  • Our products
  • Librarians
  • Societies
  • Partners and advertisers

Our imprints

  • Springer
  • Nature Portfolio
  • BMC
  • Palgrave Macmillan
  • Apress
  • Your US state privacy rights
  • Accessibility statement
  • Terms and conditions
  • Privacy policy
  • Help and support

167.114.118.210

Not affiliated

Springer Nature

© 2023 Springer Nature