The largest respectful function

DOI10.2168/LMCS-12(2:11)2016MaRDI QIDQ5739896zbMATH OpenFDO

Authors Joachim Parrow, Tjark Weber

Publication date 6 July 2016

Published in Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1605.04136

zbMATH Keywords

bisimulationcoinductioncompanionup-to techniques

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Abstract: Respectful functions were introduced by Sangiorgi as a compositional tool to formulate short and clear bisimulation proofs. Usually, the larger the respectful function, the easier the bisimulation proof. In particular the largest respectful function, defined as the pointwise union of all respectful functions, has been shown to be very useful. We here provide an explicit and constructive characterization of it.

Recommendations

• On the bisimulation proof method
• Logical Bisimulations and Functional Languages
• An intensional characterization of the largest bisimulation
• Enhancements of the bisimulation proof method
• Bisimulation and divergence

Cited in

(6)

• Corecursion up-to via causal transformations
• Diacritical companions
• Bisimulation and coinduction enhancements: a historical perspective
• Companions, codensity and causality
• Up-to techniques for behavioural metrics via fibrations
• Tower induction and up-to techniques for CCS with fixed points

This page was built for publication: The largest respectful function

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