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.
Chapter PDF
Similar content being viewed by others
Keywords
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
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.
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.
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.
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.
M. Hennessy and M. Merro. Bisimulation congruences in safe ambients. In Principles of Programming Languages, POPL 02, pages 71–80. ACM Press, 2002.
C. A. R. Hoare. Communicating Sequential Processes. Prentice Hall, 1985.
O. H. Jensen and R. Milner. Bigraphs and transitions. In Principles of Programming Languages, POPL 03. ACM Press, 2003.
G. M. Kelly. Elementary observations on 2-categorical limits. Bull. Austral. Math. Soc., 39:301–317, 1989.
G. M. Kelly and R. H. Street. Review of the elements of 2-categories. Lecture Notes in Mathematics, 420:75–103, 1974.
F.W. Lawvere. Functorial semantics of algebraic theories. Proceedings, National Academy of Sciences, 50:869–873, 1963.
J. Leifer. Operational congruences for reactive systems. Phd thesis, University of Cambridge, 2001.
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.
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.
R. Milner. Calculi for interaction. Acta Informatica, 33(8):707–737, 1996.
R. Milner. Bigraphical reactive systems: Basic theory. Technical Report 523, Computer Laboratory, University of Cambridge, 2001.
A. W. Roscoe. The Theory and Practice of Concurrency. Prentice Hall, 1997.
V. Sassone and P. Sobociński. Deriving bisimulation congruences: A 2-categorical approach. Electronic Notes in Theoretical Computer Science, 68(2), 2002.
V. Sassone and P. Sobociński. Deriving bisimulation congruences: 2-categories vs. precategories. Technical Report RS-03-1, BRICS, January 2003.
P. Sewell. From rewrite rules to bisimulation congruences. Lecture Notes in Computer Science, 1466:269–284, 1998.
R. H. Street. Fibrations in bicategories. Cahiers de topologie et géométrie différentielle, XXI-2:111–159, 1980.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sassone, V., Sobociśki, P. (2003). Deriving Bisimulation Congruences: 2-Categories Vs Precategories. In: Gordon, A.D. (eds) Foundations of Software Science and Computation Structures. FoSSaCS 2003. Lecture Notes in Computer Science, vol 2620. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36576-1_26
Download citation
DOI: https://doi.org/10.1007/3-540-36576-1_26
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00897-2
Online ISBN: 978-3-540-36576-1
eBook Packages: Springer Book Archive