DeepAI AI Chat

Abstract Congruence Criteria for Weak Bisimilarity

10/15/2020

∙

by Stelios Tsampas, et al.

∙

∙

We introduce three general compositionality criteria over operational semantics that guarantee weak bisimulation being a congruence. Our work is founded upon Turi and Plotkin's mathematical operational semantics and the coalgebraic approach to weak bisimulation by Brengos. We demonstrate each criterion with various examples of success and failure and give a formal proof of correctness for our main result.

Stelios Tsampas
8 publications
Christian Williams
3 publications
Dominique Devriese
11 publications
Frank Piessens
12 publications

page 1

page 2

page 3

page 4

∙ 05/26/2023

Meta-MeTTa: an operational semantics for MeTTa

We present an operational semantics for the language MeTTa....

0 Lucius Gregory Meredith, et al. ∙

∙ 02/22/2022

Stateful Structural Operational Semantics

Compositionality of denotational semantics is an important concern in pr...

0 Sergey Goncharov, et al. ∙

∙ 01/24/2020

Up-to Techniques for Branching Bisimilarity

Ever since the introduction of behavioral equivalences on processes one ...

0 Rick Erkens, et al. ∙

∙ 02/16/2023

Weak Similarity in Higher-Order Mathematical Operational Semantics

Higher-order abstract GSOS is a recent extension of Turi and Plotkin's f...

0 Henning Urbat, et al. ∙

∙ 04/28/2023

Caos: A Reusable Scala Web Animator of Operational Semantics (Extended With Hands-On Tutorial)

This tool paper presents Caos: a methodology and a programming framework...

0 Jose Proença, et al. ∙

∙ 12/30/2021

Studying the Interplay between Information Loss and Operation Loss in Representations for Classification

Information-theoretic measures have been widely adopted in the design of...

0 Jorge F. Silva, et al. ∙

∙ 05/17/2022

A General Framework for a Class of Quarrels: The Quarrelling Paradox Revisited

If a measure of voting power assigns greater voting power to a player be...

0 Arash Abizadeh, et al. ∙