A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
On path-based coalgebras and weak notions of bisimulation
[article]
2017
arXiv
pre-print
Preserved Fulltext
Other Versions
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 bisimulation in the context of labelled transition systems and fully probabilistic systems. It is shown that recording executions (up to a
arXiv:1705.08715v2
fatcat:fppxof3gtvhdrcrkebtdwjkk4e