Lean and Full Congruence Formats for Recursion
Abstract
In this paper I distinguish two (pre)congruence requirements for semantic equivalences and preorders on processes given as closed terms in a system description language with a recursion construct. A lean congruence preserves equivalence when replacing closed subexpressions of a process by equivalent alternatives. A full congruence moreover allows replacement within a recursive specification of subexpressions that may contain recursion variables bound outside of these subexpressions. I establish that bisimilarity is a lean (pre)congruence for recursion for all languages with a structural operational semantics in the ntyft/ntyxt format. Additionally, it is a full congruence for the tyft/tyxt format.
Keywords
Cite
@article{arxiv.1704.03160,
title = {Lean and Full Congruence Formats for Recursion},
author = {Rob van Glabbeek},
journal= {arXiv preprint arXiv:1704.03160},
year = {2017}
}
Comments
To appear in: Proc. LICS'17, Reykjavik, Iceland, IEEE