The beta version of DROPS 2 is now publicly available! Check this page out at DROPS 2 now!


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.4
URN: urn:nbn:de:0030-drops-80500
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2017/8050/
Go to the corresponding LIPIcs Volume Portal

Bakhtiari, Zeinab ; Hvid Hansen, Helle

Bisimulation for Weakly Expressive Coalgebraic Modal Logics

pdf-format:
LIPIcs-CALCO-2017-4.pdf (0.5 MB)

Abstract

Research on the expressiveness of coalgebraic modal logics with respect to semantic equivalence notions has so far focused mainly on finding logics that are able to distinguish states that are not behaviourally equivalent (such logics are said to be expressive). In other words, the notion of behavioural equivalence is taken as the starting point, and the expressiveness of the logic is evaluated against it.
However, for some applications, modal logics that are not expressive are of independent interest. Such an example is given by contingency logic.
We can now turn the question of expressiveness around and ask, given a modal logic, what is a suitable notion of semantic equivalence? In this paper, we propose a notion of \Lambda-bisimulation which is parametric in a collection
\Lambda of predicate liftings. We study the basic properties of \Lambda-bisimilarity, and prove as our main result a Hennessy-Milner style theorem, which shows that (for finitary functors) \Lambda-bisimilarity exactly matches the expressiveness of the coalgebraic modal logic arising from \Lambda.

BibTeX - Entry

@InProceedings{bakhtiari_et_al:LIPIcs:2017:8050,
  author =	{Zeinab Bakhtiari and Helle Hvid Hansen},
  title =	{{Bisimulation for Weakly Expressive Coalgebraic Modal Logics}},
  booktitle =	{7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017)},
  pages =	{4:1--4:16},
  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/8050},
  URN =		{urn:nbn:de:0030-drops-80500},
  doi =		{10.4230/LIPIcs.CALCO.2017.4},
  annote =	{Keywords: Coalgebraic modal logic, bisimulation, expressiveness, Hennessy-Milner theorem}
}

Keywords: Coalgebraic modal logic, bisimulation, expressiveness, Hennessy-Milner theorem
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