Results 1 
4 of
4
A Decentralized Implementation Of Mobile Ambients
, 2008
"... We present a graphical implementation for finite processes of the mobile ambients calculus. Our encoding uses unstructured (i.e., non hierarchical) graphs and it is sound and complete with respect to the structural congruence of the calculus (that is, two processes are equivalent iff they are mapp ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
We present a graphical implementation for finite processes of the mobile ambients calculus. Our encoding uses unstructured (i.e., non hierarchical) graphs and it is sound and complete with respect to the structural congruence of the calculus (that is, two processes are equivalent iff they are mapped into isomorphic graphs). With respect to alternative proposals for the graphical implementation of mobile ambients, our encoding distinguishes the syntactic structure of a process from the activation order of a process components. Our solution faithfully captures a basic feature of the calculus (ambients can be nested and reductions are propagated across ambient nesting) and it allows to model the reduction semantics via a graph transformation system containing just three rules.
Network applications of graph bisimulation
 PROCEEDINGS OF THE 4TH INTERNATIONAL CONFERENCE ON GRAPH TRANSFORMATION (ICGT’08), VOLUME 5214 OF LNCS
, 2008
"... Synchronising Graphs is a system of parallel graph transformation designed for modeling process interaction in a network environment. We propose a theory of contextfree synchronising graphs and a novel notion of bisimulation equivalence which is shown to be a congruence with respect to graph compo ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
Synchronising Graphs is a system of parallel graph transformation designed for modeling process interaction in a network environment. We propose a theory of contextfree synchronising graphs and a novel notion of bisimulation equivalence which is shown to be a congruence with respect to graph composition and node restriction. We use this notion of equivalence to study some sample network applications, and show that our bisimulation equivalence captures notions like functional equivalence of logical switches, equivalence of channel implementations and level of fault tolerance of a network.
A Declarative Approach to WideArea Network Programming with Service Level Agreement
, 2004
"... ..."
Rational Unification in 28 Characters
, 2005
"... We present a case study where Synchronising Graphs, a system of parallel graph transformation, are used to solve the syntactic unification problem for first order rational terms (with possibly infinite unifier). The solution we offer is efficient, that is quasilinear, and simple: a program of 28 ch ..."
Abstract
 Add to MetaCart
(Show Context)
We present a case study where Synchronising Graphs, a system of parallel graph transformation, are used to solve the syntactic unification problem for first order rational terms (with possibly infinite unifier). The solution we offer is efficient, that is quasilinear, and simple: a program of 28 characters.