Coalgebraic Tools for Bisimilarity and Decorated Trace Semantics

TL;DR

This paper explores coalgebraic methods to model and analyze various semantics of reactive systems, including bisimilarity, decorated trace, and testing semantics, providing a unified framework and verification algorithms.

Contribution

It develops a uniform coalgebraic approach to handle multiple behavioral semantics and derives verification algorithms for automated reasoning.

Findings

Unified coalgebraic framework for different semantics

Verification algorithms for automated tools

Applicability to nondeterministic, probabilistic, and internal behavior systems

Abstract

The modelling, specification and study of the semantics of concurrent reactive systems have been interesting research topics for many years now. The aim of this thesis is to exploit the strengths of the (co)algebraic framework in modelling reactive systems and reasoning on several types of associated semantics, in a uniform fashion. In particular, we are interested in handling notions of behavioural equivalence/preorder ranging from bisimilarity for systems that can be represented as non-deterministic coalgebras, to decorated trace semantics for labelled transition systems and probabilistic systems, and testing semantics for labelled transition systems with internal behaviour. Moreover, we aim at deriving a suite of corresponding verification algorithms suitable for implementation in automated tools.