A model for distributed systems based on graph rewriting
Journal of the ACM (JACM)
A calculus of mobile processes, II
Information and Computation
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A LTS Semantics of Ambients via Graph Synchronization with Mobility
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Synchronized Hyperedge Replacement with Name Mobility
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
COORDINATION '96 Proceedings of the First International Conference on Coordination Languages and Models
Reconfiguration of Software Architecture Styles with Name Mobility
COORDINATION '00 Proceedings of the 4th International Conference on Coordination Languages and Models
Graph Grammars for distributed systems
Proceedings of the 2nd International Workshop on Graph-Grammars and Their Application to Computer Science
Graph-grammars: An algebraic approach
SWAT '73 Proceedings of the 14th Annual Symposium on Switching and Automata Theory (swat 1973)
Connector colouring I: Synchronisation and context dependency
Science of Computer Programming
Exploiting User-definable Synchronizations in Graph Transformation
Electronic Notes in Theoretical Computer Science (ENTCS)
Parametric synchronizations in mobile nominal calculi
Theoretical Computer Science
Hoare vs Milner: Comparing Synchronizations in a Graphical Framework With Mobility
Electronic Notes in Theoretical Computer Science (ENTCS)
PRISMA: a mobile calculus with parametric synchronization
TGC'06 Proceedings of the 2nd international conference on Trustworthy global computing
COORDINATION'08 Proceedings of the 10th international conference on Coordination models and languages
Synchronised hyperedge replacement as a model for service oriented computing
FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
Hi-index | 0.00 |
We present a framework for modelling heterogeneous distributed systems using graph transformations in the Synchronized Hyperedge Replacement approach, which describes complex evolutions by synchronizing local rules. In order to deal with heterogeneity, we consider different synchronization algebras for different communication channels. The main technical point is the interaction between synchronization algebras and name mobility in the π-calculus style. The power of our approach is shown through a few examples.