Joachim Parrow ; Tjark Weber - The Largest Respectful Function

lmcs:1643 - Logical Methods in Computer Science, June 29, 2016, Volume 12, Issue 2 - https://doi.org/10.2168/LMCS-12(2:11)2016
The Largest Respectful FunctionArticle

Authors: Joachim Parrow ; Tjark Weber

    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.


    Volume: Volume 12, Issue 2
    Published on: June 29, 2016
    Submitted on: February 6, 2016
    Keywords: Computer Science - Logic in Computer Science

    10 Documents citing this article

    Consultation statistics

    This page has been seen 1596 times.
    This article's PDF has been downloaded 334 times.