کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
9657956 690390 2005 29 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
CCS with Hennessy's merge has no finite-equational axiomatization
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
CCS with Hennessy's merge has no finite-equational axiomatization
چکیده انگلیسی
This paper confirms a conjecture of Bergstra and Klop's from 1984 by establishing that the process algebra obtained by adding an auxiliary operator proposed by Hennessy in 1981 to the recursion free fragment of Milner's Calculus of Communicating Systems is not finitely based modulo bisimulation equivalence. Thus, Hennessy's merge cannot replace the left merge and communication merge operators proposed by Bergstra and Klop, at least if a finite axiomatization of parallel composition modulo bisimulation equivalence is desired.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Theoretical Computer Science - Volume 330, Issue 3, 9 February 2005, Pages 377-405
نویسندگان
, , , ,