Expressive logics for coinductive predicates

Clemens Kupke, Jurriaan Rot

Research output: Contribution to conferencePaper

Abstract

The classical Hennessy-Milner theorem says that two states of an image-finite transition system are bisimilar if and only if they satisfy the same formulas in a certain modal logic. In this paper we study this type of result in a general context, moving from transition systems to coalgebras and from bisimilarity to coinductive predicates. We formulate when a logic fully characterises a coinductive predicate on coalgebras, by providing suitable notions of adequacy and expressivity, and give sufficient conditions on the semantics. The approach is illustrated with logics characterising similarity, divergence and a behavioural metric on automata.
Original languageEnglish
Number of pages18
Publication statusPublished - 16 Jan 2020
EventComputer Science Logic - Barcelona, Spain
Duration: 13 Jan 202016 Jan 2020
https://www.cs.upc.edu/csl2020/

Conference

ConferenceComputer Science Logic
Abbreviated titleCSL 2020
CountrySpain
CityBarcelona
Period13/01/2016/01/20
Internet address

Fingerprint

Semantics

Keywords

  • coalgebra
  • fibration
  • modal logic

Cite this

Kupke, C., & Rot, J. (2020). Expressive logics for coinductive predicates. Paper presented at Computer Science Logic , Barcelona, Spain.
Kupke, Clemens ; Rot, Jurriaan. / Expressive logics for coinductive predicates. Paper presented at Computer Science Logic , Barcelona, Spain.18 p.
@conference{571004cd29d04d24b38838b0538ae619,
title = "Expressive logics for coinductive predicates",
abstract = "The classical Hennessy-Milner theorem says that two states of an image-finite transition system are bisimilar if and only if they satisfy the same formulas in a certain modal logic. In this paper we study this type of result in a general context, moving from transition systems to coalgebras and from bisimilarity to coinductive predicates. We formulate when a logic fully characterises a coinductive predicate on coalgebras, by providing suitable notions of adequacy and expressivity, and give sufficient conditions on the semantics. The approach is illustrated with logics characterising similarity, divergence and a behavioural metric on automata.",
keywords = "coalgebra, fibration, modal logic",
author = "Clemens Kupke and Jurriaan Rot",
year = "2020",
month = "1",
day = "16",
language = "English",
note = "Computer Science Logic , CSL 2020 ; Conference date: 13-01-2020 Through 16-01-2020",
url = "https://www.cs.upc.edu/csl2020/",

}

Kupke, C & Rot, J 2020, 'Expressive logics for coinductive predicates', Paper presented at Computer Science Logic , Barcelona, Spain, 13/01/20 - 16/01/20.

Expressive logics for coinductive predicates. / Kupke, Clemens; Rot, Jurriaan.

2020. Paper presented at Computer Science Logic , Barcelona, Spain.

Research output: Contribution to conferencePaper

TY - CONF

T1 - Expressive logics for coinductive predicates

AU - Kupke, Clemens

AU - Rot, Jurriaan

PY - 2020/1/16

Y1 - 2020/1/16

N2 - The classical Hennessy-Milner theorem says that two states of an image-finite transition system are bisimilar if and only if they satisfy the same formulas in a certain modal logic. In this paper we study this type of result in a general context, moving from transition systems to coalgebras and from bisimilarity to coinductive predicates. We formulate when a logic fully characterises a coinductive predicate on coalgebras, by providing suitable notions of adequacy and expressivity, and give sufficient conditions on the semantics. The approach is illustrated with logics characterising similarity, divergence and a behavioural metric on automata.

AB - The classical Hennessy-Milner theorem says that two states of an image-finite transition system are bisimilar if and only if they satisfy the same formulas in a certain modal logic. In this paper we study this type of result in a general context, moving from transition systems to coalgebras and from bisimilarity to coinductive predicates. We formulate when a logic fully characterises a coinductive predicate on coalgebras, by providing suitable notions of adequacy and expressivity, and give sufficient conditions on the semantics. The approach is illustrated with logics characterising similarity, divergence and a behavioural metric on automata.

KW - coalgebra

KW - fibration

KW - modal logic

UR - https://www.cs.upc.edu/csl2020/

M3 - Paper

ER -

Kupke C, Rot J. Expressive logics for coinductive predicates. 2020. Paper presented at Computer Science Logic , Barcelona, Spain.