Advertisement

Deriving Bisimulation Congruences: 2-Categories Vs Precategories

  • Vladimiro Sassone
  • Paweł Sobociśki
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2620)

Abstract

G-relative pushouts (GRPOs) have recently been proposed by the authors as a new foundation for Leifer and Milner's approach to deriving labelled bisimulation congruences from reduction systems. This paper develops the theory of GRPOs further, arguing that they provide a simple and powerful basis towards a comprehensive solution. As an example, we construct GRPOs in a category of ‘nches and wirings.’ then examine the approach based on Milner's precategories and Leifer's functorial reactive systems, and show that it can be recast in a much simpler way into the 2-categorical theory of GRPOs.

Keywords

Reduction System Label Transition System Weak Equivalence Reaction Rule Silent Transition 
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.

References

  1. [1]
    M. Bugliesi, S. Crafa, M. Merro, and V. Sassone. Communication interference in mobile boxed ambients. In Foundations of Software Technology and Theoretical Computer Science, FST&TCS 02, volume 2556 of Lecture Notes in Computer Science, pages 71–84. Springer, 2002.Google Scholar
  2. [2]
    A. Carboni, S. Lack, and R. F. C. Walters. Introduction to extensive and distributive categories. Journal of Pure and Applied Algebra, 84(2):145–158, February 1993.zbMATHCrossRefMathSciNetGoogle Scholar
  3. [3]
    G. Castagna and F. Zappa Nardelli. The seal calculus revised. In Foundations of Software Technology and Theoretical Computer Science, FST&TCS 02, volume 2556 of Lecture Notes in Computer Science, pages 85–96. Springer, 2002.Google Scholar
  4. [4]
    J. C. Godskesen, T. Hildebrandt, and V. Sassone. A calculus of mobile resources. In Int. Conf. on Concurrency Theory, CONCUR 02, volume 2421 of Lecture Notes in Computer Science, pages 272–287. Springer, 2002.Google Scholar
  5. [5]
    M. Hennessy and M. Merro. Bisimulation congruences in safe ambients. In Principles of Programming Languages, POPL 02, pages 71–80. ACM Press, 2002.Google Scholar
  6. [6]
    C. A. R. Hoare. Communicating Sequential Processes. Prentice Hall, 1985.Google Scholar
  7. [7]
    O. H. Jensen and R. Milner. Bigraphs and transitions. In Principles of Programming Languages, POPL 03. ACM Press, 2003.Google Scholar
  8. [8]
    G. M. Kelly. Elementary observations on 2-categorical limits. Bull. Austral. Math. Soc., 39:301–317, 1989.zbMATHMathSciNetCrossRefGoogle Scholar
  9. [9]
    G. M. Kelly and R. H. Street. Review of the elements of 2-categories. Lecture Notes in Mathematics, 420:75–103, 1974.MathSciNetCrossRefGoogle Scholar
  10. [10]
    F.W. Lawvere. Functorial semantics of algebraic theories. Proceedings, National Academy of Sciences, 50:869–873, 1963.Google Scholar
  11. [11]
    J. Leifer. Operational congruences for reactive systems. Phd thesis, University of Cambridge, 2001.Google Scholar
  12. [12]
    J. Leifer. Synthesising labelled transitions and operational congruences in reactive systems, parts 1 and 2. Technical Report RR-4394 and RR-4395, INRIA Rocquencourt, 2002.Google Scholar
  13. [13]
    J. Leifer and R. Milner. Deriving bisimulation congruences for reactive systems. In Int. Conf. on Concurrency Theory, CONCUR 00, Lecture Notes in Computer Science, pages 243–258. Springer, 2000.Google Scholar
  14. [14]
    R. Milner. Calculi for interaction. Acta Informatica, 33(8):707–737, 1996.CrossRefMathSciNetGoogle Scholar
  15. [15]
    R. Milner. Bigraphical reactive systems: Basic theory. Technical Report 523, Computer Laboratory, University of Cambridge, 2001.Google Scholar
  16. [16]
    A. W. Roscoe. The Theory and Practice of Concurrency. Prentice Hall, 1997.Google Scholar
  17. [17]
    V. Sassone and P. Sobociński. Deriving bisimulation congruences: A 2-categorical approach. Electronic Notes in Theoretical Computer Science, 68(2), 2002.Google Scholar
  18. [18]
    V. Sassone and P. Sobociński. Deriving bisimulation congruences: 2-categories vs. precategories. Technical Report RS-03-1, BRICS, January 2003.Google Scholar
  19. [19]
    P. Sewell. From rewrite rules to bisimulation congruences. Lecture Notes in Computer Science, 1466:269–284, 1998.Google Scholar
  20. [20]
    R. H. Street. Fibrations in bicategories. Cahiers de topologie et géométrie différentielle, XXI-2:111–159, 1980.MathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Vladimiro Sassone
    • 1
  • Paweł Sobociśki
    • 2
  1. 1.University of SussexSussex
  2. 2.University of AarhusAarhus

Personalised recommendations