The Largest Respectful Function

Joachim Parrow and Tjark Weber. Logical Methods in Computer Science, 12(2):1-8, 2016.

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.

Download

• PDF (238 kB)

BibTeX

@article{parrow16the,
  author  = {Joachim Parrow and Tjark Weber},
  title   = {The Largest Respectful Function},
  journal = {Logical Methods in Computer Science},
  volume  = {12},
  number  = {2},
  pages   = {1--8},
  year    = {2016},
  url     = {http://dx.doi.org/10.2168/LMCS-12(2:11)2016},
  doi     = {10.2168/LMCS-12(2:11)2016}
}