Generic Trace Semantics and Graded Monads

4 years 1 months ago
Generic Trace Semantics and Graded Monads
Models of concurrent systems employ a wide variety of semantics inducing various notions of process equivalence, ranging from linear-time semantics such as trace equivalence to branching-time semantics such as strong bisimilarity. Many of these generalize to system types beyond standard transition systems, featuring, for example, weighted, probabilistic, or game-based transitions; ivates the search for suitable coalgebraic abstractions of process equivalence that cover these orthogonal dimensions of generality, i.e. are generic both in the system type and in the notion of system equivalence. In recent joint work with Kurz, we have proposed a parametrization of system equivalence over an embedding of the coalgebraic type functor into a monad. In ent paper, we refine this abstraction to use graded monads, which come with a notion of depth that corresponds, e.g., to trace length or bisimulation depth. We introduce a notion of graded algebras and show how they play the role of formulas i...
Stefan Milius, Dirk Pattinson, Lutz Schröder
Added 17 Apr 2016
Updated 17 Apr 2016
Type Journal
Year 2015
Authors Stefan Milius, Dirk Pattinson, Lutz Schröder
Comments (0)