A model for distributed systems based on graph rewriting
Journal of the ACM (JACM)
Theoretical Computer Science
Distributed processes and location failures
Theoretical Computer Science
Protocol Verification as a Hardware Design Aid
ICCD '92 Proceedings of the 1991 IEEE International Conference on Computer Design on VLSI in Computer & Processors
A LTS Semantics of Ambients via Graph Synchronization with Mobility
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
A Decentralized Implementation of Mobile Ambients
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Network Applications of Graph Bisimulation
ICGT '08 Proceedings of the 4th 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
| Hi-index | 0.00 |
We investigate synchronized hyperedge replacement (SHR) as general framework for distributed programming and system design. We propose a slender version of SHR which dramaticaly reduces the mathematical overhead of the original proposal [G. Ferrari, U. Montanari, and E. Tuosto. A LTS semantics of ambients via graph synchronization with mobility. ITCS, 2001] and use it to interpret the distributed CCS [J. Riely and M. Hennessy. Distributed Processes and Location Failures. Theoretical Computer Science, 266:693-735, 2001] and the calculus of Mobile Ambients [L. Cardelli and A.D. Gordon. Mobile Ambients. Theoretical Computer Science, 1(240):177-213, 2000] in a uniform semantic framework. The encodings are bisimulations. A tool for supporting distributed system design and analysis is presented. The tool, which adopts the slender SHR as intermediate language, integrates model checking techniques within the framework of (distributed) program development.