Abstract
We present a simple labelled transition system semantics of Cardelli and Gordon’s Ambient calculus. We exploit a general and flexible model based on (hyper)graphs, where graph transformation is obtained via (hyper)edge replacement and local synchronization with mobility. In addition to tree-like ambients, the calculus we define works just as well with graph-like ambients, which are a more realistic model of internetworks.
Partially supported by CNR project Metodi per Sistemi Connessi mediante Reti; by MURST project Theory of Concurrency, Higher Order and Types; by TMR Network GETGRATS; and by Esprit Working Groups APPLIGRAPH.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Luca Cardelli and Andrew D. Gordon. A commitment relation for the ambient calculus. Manuscript.
Luca Cardelli and Andrew D. Gordon. Mobile ambients. TCS: Theoretical Computer Science, 240, 2000.
Ilaria Castellani and Ugo Montanari. Graph Grammars for Distributed Systems. In Hartmut Ehrig, Manfred Nagl, and Grzegorz Rozenberg, editors, Proc. 2nd Int. Workshop on Graph-Grammars and Their Application to Computer Science, volume 153 of Lecture Notes in Computer Science, pages 20–38. Springer-Verlag, 1983.
Rocco De Nicola, Gianluigi Ferrari, and Rosario Pugliese. KLAIM: A kernel language for agents interaction and mobility. IEEE Transactions on Software Engineering, 24(5):315–330, May 1998. Special Issue: Mobility and Network Aware Computing.
P. Degano and Ugo Montanari. A model of distributed systems based of graph rewriting. Journal of the ACM, 34:411–449, 1987.
Gianluigi Ferrari, Carlo Montangero, Laura Semini, and Simone Semprini. Mobile agents coordination in Mobadtl. In Antonio Porto and Gruia-Catalin Roman, editors, Coordination Languages and Models, volume 1906 of LNCS. Springer Verlag, 2000.
Cedric Fournet and George Gonthier. The reflexive CHAM and the join-calculus. In Conference Record of POPL’ 96: The 23 rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 372–385, St. Petersburg Beach, Florida, 21–24 January 1996.
Dan Hirsch, Paola Inverardi, and Ugo Montanari. Reconfiguration of software architecture styles with name mobility. In Antonio Porto and Gruia-Catalin Roman, editors, Coordination 2000, volume 1906 of LNCS, pages 148–163. Springer Verlag, 2000.
Dan Hirsh and Ugo Montanari. Synchronized hyperedge replacement with name mobility. In To appear in CONCUR01, 2001.
Barbara Koenig and Ugo Montanari. Observational equivalence for synchronized graph rewriting. In Proc. TACS’01, LNCS. Springer Verlag, 2001. To appear.
Ugo Montanari and Francesca Rossi. Graph rewriting and constraint solving for modeling distributed systems with synchronization. In P. Ciancarini and C. Hankin, editors, Proceedings of the First International Conference COORDINATION’ 96, Cesena, Italy, volume 1061 of LNCS. Springer Verlag, April 1996.
Gian Pietro Picco, Amy L. Murphy, and Gruia-Catalin Roman. Lime: Linda Meets Mobility. In D. Garlan, editor, Proceedings of the 21st International Conference on Software Engineering (ICSE’99), pages 368–377, Los Angeles, CA, USA, May 1999. ACM Press. Also available as Technical Report WUCS-98-21, July 1998, Washington University in St. Louis, MO, USA.
Gruia-Catalin Roman, Peter J. McCann, and J. Y. Plunn. Mobile UNITY: Reasoning and specification in mobile computing. ACM Transactions on Software Engineering and Methodology, 6(3):250–282, July 1997.
Peter Sewell. From rewrite rules to bisimulation congruences. Lecture Notes in Computer Science, 1466, 1998.
Bjorn Victor and Joachim Parrow. Concurrent constraints in the fusion calculus. Lecture Notes in Computer Science, 1443, 1998.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ferrari, G., Montanari, U., Tuosto, E. (2001). A LTS Semantics of Ambients via Graph Synchronization with Mobility. In: Theoretical Computer Science. ICTCS 2001. Lecture Notes in Computer Science, vol 2202. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45446-2_1
Download citation
DOI: https://doi.org/10.1007/3-540-45446-2_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42672-1
Online ISBN: 978-3-540-45446-5
eBook Packages: Springer Book Archive