From branching to linear time, coalgebraically
From MaRDI portal
Publication:4589615
DOI10.3233/FI-2017-1474zbMATH Open1429.68146arXiv1309.0891OpenAlexW2013127440MaRDI QIDQ4589615FDOQ4589615
Publication date: 10 November 2017
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Abstract: We consider state-based systems modelled as coalgebras whose type incorporates branching, and show that by suitably adapting the definition of coalgebraic bisimulation, one obtains a general and uniform account of the linear-time behaviour of a state in such a coalgebra. By moving away from a boolean universe of truth values, our approach can measure the extent to which a state in a system with branching is able to exhibit a particular linear-time behaviour. This instantiates to measuring the probability of a specific behaviour occurring in a probabilistic system, or measuring the minimal cost of exhibiting a specific behaviour in the case of weighted computations.
Full work available at URL: https://arxiv.org/abs/1309.0891
Recommendations
Cited In (7)
- Which branching-time properties are effectively linear?
- Title not available (Why is that?)
- Title not available (Why is that?)
- Linear-time logics -- a coalgebraic perspective
- Title not available (Why is that?)
- (in)finite trace equivalence of probabilistic transition systems
- Graded semantics and graded logics for Eilenberg-Moore coalgebras
This page was built for publication: From branching to linear time, coalgebraically
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4589615)