首页    期刊浏览 2024年11月29日 星期五
登录注册

文章基本信息

  • 标题:The Largest Respectful Function
  • 本地全文:下载
  • 作者:Joachim Parrow ; Tjark Weber
  • 期刊名称:Logical Methods in Computer Science
  • 印刷版ISSN:1860-5974
  • 电子版ISSN:1860-5974
  • 出版年度:2016
  • 卷号:12
  • 期号:2
  • 页码:1
  • DOI:10.2168/LMCS-12(2:11)2016
  • 出版社:Technical University of Braunschweig
  • 摘要: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.
  • 其他关键词:bisimulation, up-to techniques, coinduction, companion
国家哲学社会科学文献中心版权所有