Quantitative bisimulations using coreflections and open morphisms

09/25/2018
by   Jérémy Dubut, et al.
0

We investigate a canonical way of defining bisimilarity of systems when their semantics is given by a coreflection, typically in a category of transition systems. We use the fact, from Joyal et al., that coreflections preserve open morphisms situations in the sense that a coreflection induces a path subcategory in the category of systems in such a way that open bisimilarity with respect to the induced path category coincides with usual bisimilarity of their semantics. We prove that this method is particularly well-suited for systems with quantitative information: we canonically recover the path category of probabilistic systems from Cheng et al., and of timed systems from Nielsen et al., and, finally, we propose a new canonical path category for hybrid systems.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/05/2018

Rule Formats for Nominal Process Calculi

The nominal transition systems (NTSs) of Parrow et al. describe the oper...
research
09/16/2020

Comment on "Open is not forever: a study of vanished open access journals"

We comment on a recent article by Laakso et al. (arXiv:2008.11933 [cs.DL...
research
01/17/2020

Generative Datalog with Continuous Distributions

Arguing for the need to combine declarative and probabilistic programmin...
research
05/17/2021

A CCG-Based Version of the DisCoCat Framework

While the DisCoCat model (Coecke et al., 2010) has been proved a valuabl...
research
04/29/2018

Bisimilarity of diagrams

In this paper, we investigate diagrams, namely functors from any small c...
research
11/21/2021

The Central Valuations Monad

We give a commutative valuations monad Z on the category DCPO of dcpo's ...
research
09/21/2022

Adversarial Formal Semantics of Attack Trees and Related Problems

Security is a subject of increasing attention in our actual society in o...

Please sign up or login with your details

Forgot password? Click here to reset