Deriving bisimulation congruences: A 2-categorical approach

Electronic Notes in Theoretical Computer Science

Volumn 68, Issue 2, 2002, Pages 105-123

  Sassone, Vladimiro ^a   Sobociński, Pawel ^b  

^a UNIVERSITY OF SUSSEX   (United Kingdom)

^b AALBORG UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER SIMULATION; MATHEMATICAL OPERATORS; SEMANTICS; SET THEORY; SYNTACTICS;

LABELED TRANSITION SYSTEMS (LTS); PROCESS CALCULI; RELATIVE-PUSHOUTS (RPO); SEQUENTIAL COMPUTATION;

COMPUTATION THEORY;

EID: 0038180451     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)80367-6     Document Type: Conference Paper

References (21)

1. Berry G., Boudol G. The chemical abstract machine. Theoretical Computer Science. 96:1992;217-248
2. Corradini A., Ehrig H., Heckel R., Korff M., Lowe M., Ribeiro L., Wagner A. Algebraic approaches to graph transformation - part I: Single pushout approach and comparison with double pushout approach. Rozenberg G. Handbook of Graph Grammars and Computing by Graph Transformation.: Foundations. Vol. I:1997;247-312 World Scientific
3. Gadducci F., Heckel R. An inductive view of graph transformation. Workshop on Algebraic Development Techniques. 1997;223-237
4. Honda K., Yoshida N. On reduction-based process semantics. Theoretical Computer Science. 151:(2):1995;437-486
5. Kelly G.M. Elementary observations on 2-categorical limits. Bull. Austral. Math. Soc. 39:1989;301-317
6. Kelly G.M., Street R.H. Review of the elements of 2-categories. Lecture Notes in Mathematics. 420:1974;75-103
7. Lawvere F.W. Functorial semantics of algebraic theories. Proceedings, National Academy of Sciences. 50:1963;869-873
8. Leifer J. Operational congruences for reactive systems. Phd thesis. 2001;University of Cambridge
9. Leifer J. Synthesising labelled transitions and operational congruences in reactive systems, part 2. Technical Report RR-4395, INRIA Rocquencourt. 2002
10. Leifer J., Milner R. Deriving bisimulation congruences for reactive systems. International Conference on Concurrency Theory. 2000;243-258
11. Meseguer J. Conditional rewriting logic: Deduction, models and concurrency. Technical Report CSL-93-02-R, SRI International. 1990
12. Milner R. Communication and Concurrency. 1989;Prentice Hall
13. Milner R. Calculi for interaction. Acta Informatica. 33:(8):1996;707-737
14. Milner R. Bigraphical reactive systems: Basic theory. Technical Report 523, Computer Laboratory, University of Cambridge. 2001
15. Milner R., Parrow J., Walker D. A calculus of mobile processes, (Parts I and II). Information and Computation. 100:1992;1-77
16. Milner R., Sangiorgi D. Barbed bisimulation. 9th Colloquium on Automata, Languages and Programming, ICALP92, volume 623 of Lecture Notes in Computer Science. 1992;685-695 Springer Verlag
17. Park D.M. Concurrency on automata and infinite sequences. Deussen P. Conf. on Theoretical Computer Science, volume 104 of Lecture Notes in Computer Science. 1981;Springer Verlag
18. Sewell P. Prom rewrite rules to bisimulation congruences. Lecture Notes in Computer Science. 1466:1998;269-284
19. Sewell P. Working note PS12, Unpublished note. February 2000
20. Street R.H. Fibrations in bicategories. Cahiers de topologie et geometric differentielle. XXI-2:1980;111-159
21. Street R.H. Categorical structures. Hazewinkel M. Handbook of algebra. vol. 1:1996;529-577 North-Holland