کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
9655929 | 685225 | 2005 | 17 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
From Active Names to Ï-calculus Rewriting Rules
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
The problem of checking equivalences for Ï-agents is not trivial and has been widely studied in the last decade. Syntactic and semantic approaches can be taken to formally verify Ï-calculus equivalences. The syntactic approach rests mainly on structural congruence. On the other hand, the semantic checking methods can verify wider equivalences but cannot check infinitary Ï-agents. Bisimilar agents have the same set of active names. This result and a technique to check bisimulation considering active names is presented in [U. Montanari and M. Pistore. Checking bisimilarity for finitary Ï-calculus. In Insup Lee and Scott A. Smolka, editors, Proceedings of CONCUR '95, volume 962 of LNCS, pages 42-56. Springer, 1995]. There, agents active names are calculated from their corresponding Labelled Transition Systems (LTS) and, because of this, cannot be directly applied to rewriting systems. In [Ana C.V. de Melo. A study on the potential active names of Ï-agents. ENTCS (Electronic Notes in Theoretical Computer Science) 95 (C) (apr 2004) 269-286], a syntactic characterisation of active names for Ï-agents was presented. Here, new rewriting rules are presented (based on the syntactic characterisation of active names) to identify and discard useless code of Ï-expressions for a class of expressions including composition. With these new rules, Ï-expressions are better reduced (more useless code is discarded) enriching the equivalence classes of agents.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Electronic Notes in Theoretical Computer Science - Volume 130, 12 May 2005, Pages 169-185
Journal: Electronic Notes in Theoretical Computer Science - Volume 130, 12 May 2005, Pages 169-185
نویسندگان
Ana C.V. de Melo,