Linear-time logics - a coalgebraic perspective

Cirstea, Corina (2024) Linear-time logics - a coalgebraic perspective. Logical Methods in Computer Science, 20 (2), 13.1-13.55. (doi:10.46298/lmcs-20(2:13)2024).

Record type: Article

Abstract

We describe a general approach to deriving linear-time logics for a wide variety of state-based, quantitative systems, by modelling the latter as coalgebras whose type incorporates both branching and linear behaviour. Concretely, we define logics whose syntax is determined by the type of linear behaviour, and whose domain of truth values is determined by the type of branching behaviour, and we provide two semantics for them: a step-wise semantics akin to that of standard coalgebraic logics, and a path-based semantics akin to that of standard linear-time logics. The former semantics is useful for model checking, whereas the latter is the more natural semantics, as it measures the extent with which qualitative properties hold along computation paths from a given state. Our main result is the equivalence of the two semantics. We also provide a semantic characterisation of a notion of logical distance induced by these logics. Instances of our logics support reasoning about the possibility, likelihood or minimal cost of exhibiting a given linear-time property.

Text

1612.07844 - Accepted Manuscript

Available under License Creative Commons Attribution.

Download (648kB)

Text

1612.07844 - Version of Record

Available under License Creative Commons Attribution.

Download (790kB)