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
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

07/02/2021

Formal Semantics of a Classical-Quantum Language

We investigate the formal semantics of a simple imperative language that...
02/22/2022

Stateful Structural Operational Semantics

Compositionality of denotational semantics is an important concern in pr...
01/24/2020

Up-to Techniques for Branching Bisimilarity

Ever since the introduction of behavioral equivalences on processes one ...
09/07/2021

An Executable Structural Operational Formal Semantics for Python

Python is a popular high-level general-purpose programming language also...
12/20/2019

Formalizing Determinacy of Concurrent Revisions

Concurrent revisions is a concurrency control model designed to guarante...
01/08/2021

Irrationality and Transcendence Criteria for Infinite Series in Isabelle/HOL

We give an overview of our formalizations in the proof assistant Isabell...
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...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.