文章基本信息

标题：On Path-Based Coalgebras and Weak Notions of Bisimulation
本地全文：下载
作者：Harsh Beohar ; Sebastian K{\"u}pper
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2017
卷号：72
页码：6:1-6:17
DOI：10.4230/LIPIcs.CALCO.2017.6
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：It is well known that the theory of coalgebras provides an abstract definition of behavioural equivalence that coincides with strong bisimulation across a wide variety of state-based systems. Unfortunately, the theory in the presence of so-called silent actions is not yet fully developed. In this paper, we give a coalgebraic characterisation of branching (delay) bisimulation in the context of labelled transition systems (fully probabilistic systems). It is shown that recording executions (up to a notion of stuttering), rather than the set of successor states, from a state is sufficient to characterise the respected bisimulation relations in both cases.
关键词：Paths; Executions; Branching bisimulation; Coalgebras