کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
9655972 | 685234 | 2005 | 18 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Weak Bisimulation for Action-Type Coalgebras
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
We propose a coalgebraic definition of weak bisimulation for a class of coalgebras obtained from bifunctors over the category Set. Weak bisimilarity for a system is obtained as strong bisimilarity of a transformed system. The transformation consists of two steps: First, the behaviour on actions is expanded to behaviour on finite words. Second, the behaviour on finite words is taken modulo the hiding of invisible actions, yielding behaviour on equivalence classes of words closed under silent steps. The coalgebraic definition is justified by two correspondence results, one for the classical notion of weak bisimulation of Milner and another for the notion of weak bisimulation for generative probabilistic transition systems as advocated by Baier and Hermanns.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Electronic Notes in Theoretical Computer Science - Volume 122, 7 March 2005, Pages 211-228
Journal: Electronic Notes in Theoretical Computer Science - Volume 122, 7 March 2005, Pages 211-228
نویسندگان
Ana Sokolova, Erik de Vink, Harald Woracek,