Weak Bisimulation for Action-Type Coalgebras (Extended Abstract)

被引：5

作者：

Sokolova, Ana ^{[1
]}

de Vink, Erik ^{[2
]}

Woracek, Harald ^{[3
]}

机构：

[1] Eindhoven Univ Technol, TU E, Dept Math & Comp Sci, Eindhoven, Netherlands

[2] Eindhoven Univ Technol, LIACS Leiden Univ, Dept Math & Comp Sci, TU E, Leiden, Netherlands

[3] TU Vienna, Dept Anal & Sci Comp, Vienna, Austria

来源：

ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE | 2005年 / 122卷

关键词：

coalgebra; bisimulation; weak bisimulation; labeled transition system; generative probabilistic transition system;

D O I：

10.1016/j.entcs.2004.06.050

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

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.

引用

页码：211 / 228

页数：18