Reactive systems over cospans

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2005, Pages 311-320

  Sassone, Vladimiro ^a   Sobociński, Paweł ^b  

^a UNIVERSITY OF SUSSEX   (United Kingdom)

^b UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COSPANS; LABELED TRANSITION SYSTEMS (LTS); REACTIVE SYSTEMS; SEMANTIC MODELS;

COMPUTER SCIENCE; CONTEXT FREE LANGUAGES; MATHEMATICAL MODELS;

SEMANTICS;

EID: 26944478568     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. P. Baldan, A. Corradini, H. Ehrig, and R. Heckel. Compositional modeling of reactive systems using open nets. In CONCUR '01, volume 2154 of LNCS. Springer, 2001.
2. J. Bénabou. Introduction to bicategories. In Midwest Category Seminar, volume 42 of LNM, pages 1-77. Springer, 1967.
3. G. Berry and G. Boudol. The chemical abstract machine. Theoretical Computer Science, 96:217-248, 1992.
4. H. Ehrig, G. Engels, H.-J. Kreowski, U. Montanari, and G. Rozenberg, editors. Graph Grammars and Computing by Graph Transformation, Vol. 1-3. World Scientific, 1999.
5. H. Ehrig and B. König. Deriving bisimulation congruences in the DPO approach to graph rewriting. In FOSSACS '04, volume 2987 of LNCS, pages 151-166. Springer, 2004.
6. F. Gadducci and R. Heckel. An inductive view of graph transformation. In WADT '97, pages 223-237, 1997.
7. F. Gadducci, R. Heckel, and M. Llabrés. A bi-categorical axiomatisation of concurrent graph rewriting. In CTCS '99, volume 29 of ENTCS. Elsevier, 1999.
8. O. H. Jensen and R. Milner. Bigraphs and mobile processes. Technical Report 570, University of Cambridge, 2003.
9. P. Katis, N. Sabadini, and R. F. C. Walters. Bicategories of processes. J. Pure Appl. Algebra, 115:141-178, 1997.
10. S. Lack and P. Sobociński. Adhesive categories. In FOSSACS '04, volume 2987 of LNCS. Springer, 2004.
11. J. Leifer. Operational congruences for reactive systems. Phd thesis, University of Cambridge, 2001.
12. J. Leifer and R. Milner. Deriving bisimulation congruences for reactive systems. In CONCUR '00, volume 1877 of LNCS, pages 243-258. Springer, 2000.
13. R. Milner. Bigraphical reactive systems. In Concur '01, volume 2154 of LNCS, pages 16-35. Springer, 2001.
14. R. Milner. Bigraphs for Petri nets. In Lectures on Con-currency and Petri Nets 2003, volume 3098 of LNCS, pages 686-701. Springer, 2004.
15. V. Sassone and P. Sobociński. Deriving bisimulation congruences: 2-categories vs precategories. In FOSSACS '03, volume 2620 of LNCS. Springer, 2003.
16. Full version to appear in Theor. Comp. Sci.
17. V. Sassone and P. Sobociński. Deriving bisimulation congruences using 2-categories. Nord. J. Comput., 10(2):163-183, 2003.
18. V. Sassone and P. Sobociński. A congruence for Petri nets. In Workshop on Petri Nets and Graph Transformation, 2004.
19. V. Sassone and P. Sobociński. Congruences for contextual graph-rewriting. Technical Report RS-14, BRICS, 2004.
20. P. Sewell. From rewrite rules to bisimulation congruences. Theoretical Computer Science, 274(1-2):183-230, 2002.
21. P. Sobociński. Deriving process congruences from reaction rules. PhD thesis, BRICS, University of Aarhus, 2004.