Summary 1: Adhesivity, Bigraphs and Bisimulation Congruences

Author Pawel Sobocinski

Thumbnail PDF


  • Filesize: 354 kB
  • 12 pages

Document Identifiers

Author Details

Pawel Sobocinski

Cite AsGet BibTex

Pawel Sobocinski. Summary 1: Adhesivity, Bigraphs and Bisimulation Congruences. In Graph Transformations and Process Algebras for Modeling Distributed and Mobile Systems. Dagstuhl Seminar Proceedings, Volume 4241, pp. 1-12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)


This paper is intended as a short informal summary of some of the topics which arose at the Dagstuhl meeting held 6/06/04-11/06/04. In particular, we shall summarise some of the content of talks by H. Ehrig, F. Gadducci, O. H. Jensen, R. Milner, B. K�¶nig, V. Sassone and the author. The general areas include adhesive categories and generalisations, contextual labelled transition semantics for graph transformation systems via borrowed-contexts and GIPOs, and bigraphs. We shall conclude with a summary of some of the discussions which followed the aforementioned presentations.
  • graph transformation
  • category theory
  • bisimulation


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads