The Largest Respectful Function

Joachim Parrow; Tjark Weber

doi:10.2168/LMCS-12(2:11)2016

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.

https://doi.org/10.2168/LMCS-12(2:11)2016

Source: arXiv.org:1605.04136

Volume: Volume 12, Issue 2

Published on: June 29, 2016

Imported on: February 6, 2016

Keywords: Computer Science - Logic in Computer Science

Licence: arXiv.org - Non-exclusive license to distribute

Classifications

Mathematics Subject Classification 2020¹

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

Sources:

[1] zbMATH Open.

Bibliographic References

11 Documents citing this article

Davide Sangiorgi, 2024, An Abstract Account of Up-to Techniques for Inductive Behavioural Relations, arXiv (Cornell University), pp. 62-74, 10.1007/978-3-031-73709-1_5, http://arxiv.org/abs/2412.07351.

Filippo Bonchi;Barbara König;Daniela Petrişan, 2023, Up-to techniques for behavioural metrics via fibrations, Mathematical Structures in Computer Science, 33, 4-5, pp. 182-221, 10.1017/s0960129523000166, https://doi.org/10.1017/s0960129523000166.

Damien Pous;Jurriaan Rot;Ruben Turkenburg, 2022, Corecursion Up-to via Causal Transformations, pp. 133-154, 10.1007/978-3-031-10736-8_7, https://hal.science/hal-03694381.

Davide Sangiorgi, 2022, From enhanced coinduction towards enhanced induction, Proceedings of the ACM on Programming Languages, 6, POPL, pp. 1-29, 10.1145/3498679, https://doi.org/10.1145/3498679.

Yannick Zakowski;Paul He;Chung-Kil Hur;Steve Zdancewic, 2020, An equational theory for weak bisimulation via generalized parameterized coinduction, arXiv (Cornell University), pp. 71-84, 10.1145/3372885.3373813, http://arxiv.org/abs/2001.02659.

Damien Pous;Davide Sangiorgi, 2019, Bisimulation and Coinduction Enhancements: A Historical Perspective, SPIRE - Sciences Po Institutional REpository, 31, 6, pp. 733-749, 10.1007/s00165-019-00497-w, https://hal.science/hal-02393949.

Dariusz Biernacki;Sergueï Lenglet;Piotr Polesiuk, 2019, Diacritical Companions, Electronic Notes in Theoretical Computer Science, 347, pp. 25-43, 10.1016/j.entcs.2019.09.003, https://doi.org/10.1016/j.entcs.2019.09.003.

Filippo Bonchi;Pierre Ganty;Roberto Giacobazzi;Dusko Pavlovic, 2018, Sound up-to techniques and Complete abstract domains, arXiv (Cornell University), 24, pp. 175-184, 10.1145/3209108.3209169, http://arxiv.org/abs/1804.10507.

Damien Pous;Jurriaan Rot, 2017, Companions, Codensity and Causality, Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands, pp. 106-123, 10.1007/978-3-662-54458-7_7, https://ir.cwi.nl/pub/25696.

Nils Anders Danielsson, 2017, Up-to techniques using sized types, Proceedings of the ACM on Programming Languages, 2, POPL, pp. 1-28, 10.1145/3158131, https://doi.org/10.1145/3158131.

Steven Schäfer;Gert Smolka, 2017, Tower Induction and Up-to Techniques for CCS with Fixed Points, Lecture notes in computer science, pp. 274-289, 10.1007/978-3-319-57418-9_17.

Sources : OpenCitations, OpenAlex & Crossref

Share and export

Consultation statistics

This page has been seen 3172 times.

This article's PDF has been downloaded 493 times.