V. Alexiev (1999):
Non-deterministic interaction nets.
University of Alberta,
Edmonton, Alta., Canada.
P. Baldan, H. Ehrig & B. König (2006):
Composition and Decomposition of DPO Transformations with Borrowed Context.
In: Proc. of ICGT '06 (International Conference on Graph Transformation).
Springer,
pp. 153–167,
doi:10.1007/1184188312.
LNCS 4178.
F. Bonchi, F. Gadducci & G. V. Monreale (2009):
Labelled transitions for mobile ambients (as synthesized via a graphical encoding).
Electronic Notes in Theoretical Computer Science 242(1),
pp. 73–98,
doi:10.1016/j.entcs.2009.06.014.
B. Braatz, H. Ehrig, G. Karsten & U. Golas (2010):
Finitary M-adhesive categories.
In: Graph Transformations: 5th International Conference, ICGT 2010, Twente, the Netherlands, September 27–October 2, 2010, Proceedings.
Springer-Verlag,
pp. 234–249,
doi:10.1007/978-3-642-15928-216.
Andrea Corradini, Reiko Heckel & Ugo Montanari (2000):
Graphical Operational Semantics.
In: ICALP Satellite Workshops,
pp. 411–418.
T. Ehrhard & L. Regnier (2006):
Differential interaction nets.
Theoretical Computer Science 364(2),
pp. 166–195,
doi:10.1016/j.tcs.2006.08.003.
H. Ehrig & B. König (2006):
Deriving Bisimulation Congruences in the DPO Approach to Graph Rewriting with Borrowed Contexts.
Mathematical Structures in Computer Science 16(6),
pp. 1133–1163,
doi:10.1017/S096012950600569X.
F. Gadducci & U. Montanari (2000):
The tile model.
In: Gordon D. Plotkin, Colin Stirling & Mads Tofte: Proof, Language, and Interaction.
The MIT Press,
pp. 133–166.
B. König, U. Montanari & P. Gardner (2005):
04241 Abstracts Collection.
Dagstuhl Seminar Proceedings 04241.
Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany,
Dagstuhl, Germany.
Available at http://drops.dagstuhl.de/opus/volltexte/2005/27.
S. Lack & P. Sobociński (2005):
Adhesive and quasiadhesive categories.
RAIRO - Theoretical Informatics and Applications 39(2),
pp. 522–546,
doi:10.1051/ita:2005028.
Y. Lafont (1990):
Interaction nets.
In: Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages,
POPL '90.
ACM,
New York, NY, USA,
pp. 95–108,
doi:10.1145/96709.96718.
Y. Lafont (1995):
From proof-nets to interaction nets.
In: Proceedings of the workshop on Advances in linear logic.
Cambridge University Press,
New York, NY, USA,
pp. 225–247,
doi:10.1017/CBO9780511629150.012.
J. J. Leifer & R. Milner (2000):
Deriving Bisimulation Congruences for Reactive Systems.
In: Catuscia Palamidessi: CONCUR,
Lecture Notes in Computer Science 1877.
Springer,
pp. 243–258,
doi:10.1007/3-540-44618-419.
D. Mazza (2006):
Interaction Nets: Semantics and Concurrent Extensions.
Université de la Méditerranée & Roma Tre.
J. Rathke & P. Sobociński (2010):
Deriving structural labelled transitions for mobile ambients.
Information and Computation 208,
pp. 1221–1242,
doi:10.1016/j.ic.2010.06.001.
V. Sassone & P. Sobociński (2003):
Deriving Bisimulation Congruences Using 2-categories.
Nordic Journal of Computing 10(2),
pp. 163–183.
A. Simpson (2004):
Sequent calculi for process verification: Hennessy-Milner logic for an arbitrary GSOS.
Journal of Logic and Algebraic Programming 60–61,
pp. 287–322,
doi:10.1016/j.jlap.2004.03.004.