Robustness of equations under operational extensions

MaRDI QIDQ4964002zbMATH OpenFDO

Authors Peter D. Mosses, Mohammadreza Mousavi, Michel A. Reniers

Publication date 24 February 2021

Full work available at URL https://arxiv.org/abs/1011.6435, http://eptcs.web.cse.unsw.edu.au/paper.cgi?EXPRESS10.8

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• scientific article; zbMATH DE number 1231603
• Proving the validity of equations in GSOS languages using rule-matching bisimilarity
• Bisimilarity of open terms.
• A bisimulation-based method for proving the validity of equations in GSOS languages
• Combining bialgebraic semantics and equations

Cited in

(3)

• On the equivalence of robustness to canonical and general elaborations
• Generating specialized interpreters for modular structural operational semantics
• Robustness of Solutions of Almost Every System of Equations

This page was built for publication: Robustness of equations under operational extensions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4964002)