DeepAI AI Chat

Cellular Monads from Positive GSOS Specifications

08/29/2019

∙

by Tom Hirschowitz, et al.

∙

∙

We give a leisurely introduction to our abstract framework for operational semantics based on cellular monads on transition categories. Furthermore, we relate it for the first time to an existing format, by showing that all Positive GSOS specifications generate cellular monads whose free algebras are all compositional. As a consequence, we recover the known result that bisimilarity is a congruence in the generated labelled transition system.

page 1

page 2

page 3

page 4

∙ 12/11/2020

Modules over monads and operational semantics

This paper is a contribution to the search for efficient and high-level ...

0 André Hirschowitz, et al. ∙

∙ 09/04/2017

Distributive Laws for Monotone Specifications

Turi and Plotkin introduced an elegant approach to structural operationa...

0 Jurriaan Rot, et al. ∙

∙ 07/05/2018

Rule Formats for Nominal Process Calculi

The nominal transition systems (NTSs) of Parrow et al. describe the oper...

0 Luca Aceto, et al. ∙

∙ 02/08/2019

A Hybrid Dynamic Logic for Event/Data-based Systems

We propose E^↓-logic as a formal foundation for the specification and de...

0 Rolf Hennicker, et al. ∙

∙ 01/20/2022

A Guideline for the Statistical Analysis of Compositional Data in Immunology

The study of immune cellular composition is of great scientific interest...

0 Jinkyung Yoo, et al. ∙

∙ 08/23/2019

On the Meaning of Transition System Specifications

Transition System Specifications provide programming and specification l...

0 Rob van Glabbeek, et al. ∙

∙ 08/19/2019

Divide and Congruence III: From Decomposition of Modal Formulas to Preservation of Stability and Divergence

In two earlier papers we derived congruence formats with regard to trans...

0 Wan Fokkink, et al. ∙