Graphs, reactive systems and mobile ambients. Supervisor: F. Gadducci. Giacoma Valentina Monreale. Sound and complete w.r.t. the structural congruence of MAs. Graphical encoding for MAs. Syntax: P:= 0 , n[P], M.P, ( n)P, P 1 |P 2 M:= in n, out n, open n . ambient name. process.
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
Giacoma Valentina Monreale
Syntax: P:= 0, n[P], M.P, ( n)P, P1|P2 M:= in n, out n, open n
(n)(n[in m.0]|m[out m.0])
Graphs trasformation rules
n[P]|open n.Q P|Q
n[in m.P|Q]|m[R] m[n[P|Q]|R]
m[n[out m.P|Q]|R] n[P|Q]|m[R]
We derive a LTS on graphs by applying the borrowed context technique, which is an instance of the theory of reactive systems
The bisimilarity on the distilled LTS is too strict
We propose notions of strong and weak barbed saturated semantics for LTS synthesized using the theory of reactive systems
Barbs are predicates over the states of a system: Po if P satisfies o
Weak barbs: Po if P P’ and P’o
weak barbed semi-saturated
Barbed semi-saturated bisimilarity∼BSS is the largest barbed semi-saturated bisimulation.
(Weak) Barbed saturated bisimilarity for MAs coincides with (weak) reduction barbed congruence