Skip to main content
SpringerLink
Log in

Convenient category of processes and simulations I: Modulo strong bisimilarity

  • Conference paper
  • First Online:
Category Theory and Computer Science (CTCS 1995)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 953))

Included in the following conference series:

Abstract

Deep categorical analyses of various aspects of concurrency have been developed, but a uniform categorical treatment of the very first concepts seems to be hindered by the fact that the existing representations of processes as bisimilarity classes do not provide a sufficient account of computational morphisms.

In the present paper, we describe a category of processes modulo strong bisimulations, with the bisimilarity preserving simulations as morphisms, and show that it is isomorphic to — and can be conveniently represented by — a subcategory of transition systems, with graph morphisms. The representative of each process and every morphism can effectively calculated, using coinduction (but with no reference to proper classes). The method is applicable to richer notions of a process as well, which are studied in the sequel.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Abramsky, Interaction categories, manuscript (1994); extended abstract in: G. Burn et al (eds.), Theory and Formal Methods 1993, Workshops in Computing (Springer 1993) 57–69

    Google Scholar 

  2. P. Aczel, Non-Well-Founded Sets, Lecture Notes 14 (CSLI 1988)

    Google Scholar 

  3. P. Aczel and P.F. Mendler, A final coalgebra theorem, in: Category Theory and Computer Science, D.H. Pitt et al. (eds.), Lecture Notes in Computer Science 389 (Springer 1989) 357–365

    Google Scholar 

  4. M. Barr, Terminal coalgebras in well-founded set theory, Theoret. Comput. Sci. 114(1993) 299–315

    Google Scholar 

  5. D.B. Benson and O. Ben-Shachar, Bisimulation of automata, Information and Computation 79(1988) 60–83

    Google Scholar 

  6. J. van Bentham, Correspondence theory, in: Handbook of Philosophical Logic, D.M. Gabbay, ed., (Reidel 1984) 167–247

    Google Scholar 

  7. J.A. Bergstra and J.W. Klop, Algebra of communicating processes with abstraction, Theoret. Comput. Sci. 37(1985) 77–121

    Google Scholar 

  8. I. Castellani, Bisimulations and abstraction morphisms, in: H. Ehrig et al., eds., Mathematical Foundations of Software Development, Vol.1: CAAP '85 Lecture Notes in Computer Science 185 (Springer 1986) 224–238

    Google Scholar 

  9. P.J. Freyd and A. Scedrov, Categories, Allegories, North-Holland Mathematical Library 39 (North-Holland, 1990)

    Google Scholar 

  10. R.J. van Glabbeek, Comparative Concurrency Semantics and Refinement of Actions, thesis (CWI, 1990)

    Google Scholar 

  11. J.E. Hopcroft and J.D. Ullman, Introduction to Automata Theory, Languages and Computation (Addison-Wesley 1979)

    Google Scholar 

  12. A. Joyal, M. Nielsen and G. Winskel, Bisimulation and open maps, Proceedings of the Eight Symposium on Logic in Computer Science (IEEE 1993) 418–427

    Google Scholar 

  13. D. Park, Concurrency and Automata on Infinite Sequences, Lecture Notes in Computer Science 104 (Springer 1980)

    Google Scholar 

  14. D. Pavlovic, Categorical interpolation: descent and the Beck-Chevalley condition without direct images, in: A. Carboni et al. (eds.), Category Theory, Lecture Notes in Mathematics 1488 (Springer, 1991) 306–326

    Google Scholar 

  15. D. Pavlovic, Maps II: Chasing diagrams in categorical proof theory, submitted

    Google Scholar 

  16. D. Pavlovic, Categorical logic of concurrency and interaction I: Synchronous processes, in: C. Hankin et al. (eds.), Proceedings of the Second TFM Workshop, Cambridge 1994 (World Scientific 1995)

    Google Scholar 

  17. D. Pavlovic, Categorical logic of concurrency and interaction II: Asynchronous processes, in preparation.

    Google Scholar 

  18. D. Pavlovic, Convenient Categories of Processes and Simulations II: Asynchronous Cases, submitted

    Google Scholar 

  19. J.J.M.M Rutten and D. Turi, Initial algebra and final coalgebra semantics for concurrency, in: J.W. de Bakker et al. (eds.), Proc. of the REX School, Lecture Notes in Computer Science (Springer 1994)

    Google Scholar 

  20. K. Segeberg, Decidability of S4.1, Theoria 34(1968) 7–20

    Google Scholar 

  21. G. Winskel and M. Nielsen, Models for concurrency, in: S. Abramsky et al. (eds.), Handbook of Logic in Computer Science, vol. IV (Clarendon Press 1994) to appear

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Deptepartment of Computing, Imperial College of Science, Technology and Medicine, SW7 2BZ, London, England

    Duško Pavlović

Authors
  1. Duško Pavlović
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

David Pitt David E. Rydeheard Peter Johnstone

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pavlović, D. (1995). Convenient category of processes and simulations I: Modulo strong bisimilarity. In: Pitt, D., Rydeheard, D.E., Johnstone, P. (eds) Category Theory and Computer Science. CTCS 1995. Lecture Notes in Computer Science, vol 953. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60164-3_17

Download citation

  • DOI: https://doi.org/10.1007/3-540-60164-3_17

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60164-7

  • Online ISBN: 978-3-540-44661-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation