Fibrational Bisimulations and Quantitative Reasoning - Coalgebraic Methods in Computer Science
Conference Papers Year : 2018

Fibrational Bisimulations and Quantitative Reasoning

Abstract

Bisimulation and bisimilarity are fundamental notions in comparing state-based systems. Their extensions to a variety of systems have been actively pursued in recent years, a notable direction being quantitative extensions. In this paper we present an abstract categorical framework for such extended (bi)simulation notions. We use coalgebras as system models and fibrations for organizing predicates—following the seminal work by Hermida and Jacobs—but our focus is on the structural aspect of fibrational frameworks. Specifically we use morphisms of fibrations as well as canonical liftings of functors via Kan extensions. We apply this categorical framework by deriving some known properties of the Hausdorff pseudometric and approximate bisimulation in control theory.
Fichier principal
Vignette du fichier
473364_1_En_11_Chapter.pdf (174.89 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01901092 , version 1 (21-02-2019)

Licence

Identifiers

Cite

David Sprunger, Shin-Ya Katsumata, Jérémy Dubut, Ichiro Hasuo. Fibrational Bisimulations and Quantitative Reasoning. 14th International Workshop on Coalgebraic Methods in Computer Science (CMCS), Apr 2018, Thessaloniki, Greece. pp.190-213, ⟨10.1007/978-3-030-00389-0_11⟩. ⟨hal-01901092⟩
190 View
205 Download

Altmetric

Share

More