Abstract Congruence Criteria for Weak Bisimilarity

10/15/2020
by   Stelios Tsampas, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/26/2023

Meta-MeTTa: an operational semantics for MeTTa

We present an operational semantics for the language MeTTa....
research
02/22/2022

Stateful Structural Operational Semantics

Compositionality of denotational semantics is an important concern in pr...
research
07/11/2023

Probabilistic Operational Correspondence (Technical Report)

Encodings are the main way to compare process calculi. By applying quali...
research
01/24/2020

Up-to Techniques for Branching Bisimilarity

Ever since the introduction of behavioral equivalences on processes one ...
research
07/07/2023

ConStaBL – A Fresh Look at Software Engineering with State Machines

Statechart is a visual modelling language for systems. In this paper, we...
research
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...
research
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...

Please sign up or login with your details

Forgot password? Click here to reset