Labels from reductions: Towards a general theory

Lecture Notes in Computer Science

Volumn 3629, Issue , 2005, Pages 30-50

  Klin, Bartek ^a   Sassone, Vladimiro ^b   Sobociński, Pawel ^c  

^a UNIVERSITY OF WARSAW   (Poland)

^b UNIVERSITY OF SUSSEX   (United Kingdom)

^c UNIVERSITÉ PARIS 13   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; THEOREM PROVING;

LABELED TRANSITIONS; OPEN TERMS; REDUCTION SYSTEMS;

COMPUTER SCIENCE;

EID: 26944475513     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11548133_2     Document Type: Conference Paper

References (17)

1. H. Ehrig and B. König. Deriving bisimulation congruences in the DPO approach to graph re writing. In Proceedings of FoSSaCS'04, 7th International Conference on Foundations of Software Science and Computation Structures, volume 2987 of LNCS, pages 151-166, 2004.
2. F. Gadducci and U. Montanari. The tile model. In G. Plotkin, C. Stirling, and M. Tofte, editors. Proof, Language and Interaction: Essays in Honour of Robin Milner, pages 133-166. MIT Press, 2000.
3. O. H. Jensen and R. Milner. Bigraphs and mobile processes. Technical Report 570, University of Cambridge, 2003.
4. J. Leifer and R. Milner. Deriving bisimulation congruences for reactive systems. In International Conference on Concurrency Theory, CONCUR'00, volume 1877 of LNCS, pages 243-258, 2000.
5. S. Mac Lane. Categorical algebra. Bulletin of the American Mathematical Society, 71:40-106, 1965.
6. S. Mac Lane. Categories for the Working Mathematician. Graduate Texts in Mathematics. Springer Verlag, 2nd edition, 1992.
7. R. Milner. Calculi for interaction. Acta Informatica, 33(8):707-737, 1996.
8. R. Milner. Bigraphical reactive systems. In International Conference on Concurrency Theory, CONCUR'01, volume 2154 of LNCS, pages 16-35, 2001.
9. R. Milner. Bigraphs for Petri nets. In Lectures on Concurrency and Petri Nets 2003, volume 3098 of Lecture Notes in Computer Science, pages 686-701, 2004.
10. G. Plotkin. A structural approach to operational semantics. Technical Report DAIMI FN-19, Aarhus University, Computer Science Department, 1981.
11. V. Sassone and P. Sobociński. Deriving bisimulation congruences using 2-categories. Nordic Journal of Computing, 10(2): 163-183, 2003.
12. V. Sassone and P. Sobociński. A congruence for Petri nets. In Workshop on Petri Nets and Graph Transformation, volume 127 of ENTCS, pages 107-120, 2005.
13. V. Sassone and P. Sobociński. Locating reaction with 2-categories. Theoretical Computer Science, 333(1-2):297-327, 2005.
14. V. Sassone and P. Sobociński. Reactive systems over cospans. Proceedings of Logics in Computer Science, LICS 2005, IEEE Press 2005.
15. P. Sewell. Working notes PS15-PS19, 2000. Unpublished notes.
16. P. Sewell. From rewrite rules to bisimulation congruences. Theoretical Computer Science, 274(1-2): 183-230, 2002.
17. P. Sobociński. Deriving process congruences from reaction rules. PhD thesis, BRICS, University of Aarhus, 2004.