کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
9656028 | 685534 | 2005 | 17 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Ambient Graph Rewriting
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Ambient Graph Rewriting Ambient Graph Rewriting](/preview/png/9656028.png)
چکیده انگلیسی
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.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Electronic Notes in Theoretical Computer Science - Volume 117, 20 January 2005, Pages 335-351
Journal: Electronic Notes in Theoretical Computer Science - Volume 117, 20 January 2005, Pages 335-351
نویسندگان
Pietro Cenciarelli, Ivano Talamo, Alessandro Tiberi,