Deriving Bisimulation Congruences: 2-categories vs precategories
Sassone, V. and Sobocinski, P. (2003) Deriving Bisimulation Congruences: 2-categories vs precategories. In, Foundations of Software Science and Computation Structures, FOSSACS 2003. Springer, 409-424.
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 ‘bunches and wirings.’ We 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.
|Item Type:||Conference or Workshop Item (Paper)|
|Keywords:||bisimulation congruences, labelled transition systems, observational equivalences, coinduction principles|
|Divisions:||Faculty of Physical and Applied Science > Electronics and Computer Science > Web & Internet Science
Faculty of Physical and Applied Science > Electronics and Computer Science > Electronic & Software Systems
|Date Deposited:||11 Apr 2006|
|Last Modified:||01 Mar 2012 23:18|
|Contributors:||Sassone, V. (Author)
Sobocinski, P. (Author)
|Further Information:||Google Scholar|
|ISI Citation Count:||12|
|RDF:||RDF+N-Triples, RDF+N3, RDF+XML, Browse.|
Actions (login required)