2000 character limit reached
Cellular Monads from Positive GSOS Specifications (1908.11169v1)
Published 29 Aug 2019 in cs.LO, cs.PL, and math.CT
Abstract: 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.