DeepAI AI Chat
Log In Sign Up

Weighted and Branching Bisimilarities from Generalized Open Maps

by   Jérémy Dubut, et al.

In the open map approach to bisimilarity, the paths and their runs in a given state-based system are the first-class citizens, and bisimilarity becomes a derived notion. While open maps were successfully used to model bisimilarity in non-deterministic systems, the approach fails to describe quantitative system equivalences such as probabilistic bisimilarity. In the present work, we see that this is indeed impossible and we thus generalize the notion of open maps to also accommodate weighted and probabilistic bisimilarity. Also, extending the notions of strong path and path bisimulations into this new framework, we show that branching bisimilarity can be captured by this extended theory and that it can be viewed as the history preserving restriction of weak bisimilarity.


page 1

page 2

page 3

page 4


Codensity Games for Bisimilarity

Bisimilarity as an equivalence notion of systems has been central to pro...

Extended retraction maps: a seed of geometric integrators

The classical notion of retraction map used to approximate geodesics is ...

Effective Kan fibrations in simplicial sets

We introduce the notion of an effective Kan fibration, a new mathematica...

On Linear Representation, Complexity and Inversion of maps over finite fields

The paper primarily addressed the problem of linear representation, inve...

A Faithful and Quantitative Notion of Distant Reduction for Generalized Applications (Long Version)

We introduce a call-by-name lambda-calculus λ J with generalized applica...

A comonadic view of simulation and quantum resources

We study simulation and quantum resources in the setting of the sheaf-th...

Extending OCaml's 'open'

We propose a harmonious extension of OCaml's 'open' construct. OCaml's...