Fundamenta Informaticae - Special issue on graph transformations
Hyperedge replacement graph grammars
Handbook of graph grammars and computing by graph transformation
Algebraic approaches to graph transformation. Part I: basic concepts and double pushout approach
Handbook of graph grammars and computing by graph transformation
Theoretical Computer Science
ACM Transactions on Programming Languages and Systems (TOPLAS)
Normal forms for algebras of connections
Theoretical Computer Science
A LTS Semantics of Ambients via Graph Synchronization with Mobility
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
A spatial logic for concurrency (part I)
Information and Computation - TACS 2001
BioAmbients: an abstraction for biological compartments
Theoretical Computer Science - Special issue: Computational systems biology
Behavioral theory for mobile ambients
Journal of the ACM (JACM)
Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts
Mathematical Structures in Computer Science
Graph rewriting for the π-calculus
Mathematical Structures in Computer Science
Electronic Notes in Theoretical Computer Science (ENTCS)
Pure bigraphs: Structure and dynamics
Information and Computation
Process bisimulation via a graphical encoding
ICGT'06 Proceedings of the Third international conference on Graph Transformations
A graph syntax for processes and services
WS-FM'09 Proceedings of the 6th international conference on Web services and formal methods
LTS semantics for process calculi from their graphical encodings
ICGT'10 Proceedings of the 5th international conference on Graph transformations
On the expressiveness of the π-calculus and the mobile ambients
AMAST'10 Proceedings of the 13th international conference on Algebraic methodology and software technology
Adhesivity is not enough: local church-rosser revisited
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
| Hi-index | 0.00 |
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.