کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
423610 | 685262 | 2008 | 15 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Decidability of Weak Bisimilarity for a Subset of BPA
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
In this paper we use the tableau as a means to prove decidability of weak bisimulation for normed BPA. Decidability was proved for a restricted subclass, the totally normed processes by Hirshfeld [Hirshfeld, Y., Bisimulation trees and the decidability of weak bisimulations. In: INFINITY 1996. proceedings of the 1st International Workshop on Verification of Infinite State Systems, Germany, vol. 5]. However in the case that weak bisimilarity to be decidable is inequivalence is finitely approximable. In this paper we relax restriction of totally normedness and prove decidability of weak bisimilarity for a subset of normed BPA which permit the norm of BPA processes is zero.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Electronic Notes in Theoretical Computer Science - Volume 212, 30 April 2008, Pages 241-255
Journal: Electronic Notes in Theoretical Computer Science - Volume 212, 30 April 2008, Pages 241-255