License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CALCO.2017.6
URN: urn:nbn:de:0030-drops-80362
URL: https://drops.dagstuhl.de/opus/volltexte/2017/8036/
Go to the corresponding LIPIcs Volume Portal


Beohar, Harsh ; K├╝pper, Sebastian

On Path-Based Coalgebras and Weak Notions of Bisimulation

pdf-format:
LIPIcs-CALCO-2017-6.pdf (0.6 MB)


Abstract

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.

BibTeX - Entry

@InProceedings{beohar_et_al:LIPIcs:2017:8036,
  author =	{Harsh Beohar and Sebastian K{\"u}pper},
  title =	{{On Path-Based Coalgebras and Weak Notions of Bisimulation}},
  booktitle =	{7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017)},
  pages =	{6:1--6:17},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-033-0},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{72},
  editor =	{Filippo Bonchi and Barbara K{\"o}nig},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2017/8036},
  URN =		{urn:nbn:de:0030-drops-80362},
  doi =		{10.4230/LIPIcs.CALCO.2017.6},
  annote =	{Keywords: Paths, Executions, Branching bisimulation, Coalgebras}
}

Keywords: Paths, Executions, Branching bisimulation, Coalgebras
Collection: 7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017)
Issue Date: 2017
Date of publication: 17.11.2017


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI