| Autor: |
Joachim Parrow, Tjark Weber |
| Jazyk: |
angličtina |
| Rok vydání: |
2016 |
| Předmět: |
|
| Zdroj: |
Logical Methods in Computer Science, Vol Volume 12, Issue 2 (2016) |
| Druh dokumentu: |
article |
| ISSN: |
1860-5974 |
| DOI: |
10.2168/LMCS-12(2:11)2016 |
| Popis: |
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. |
| Databáze: |
Directory of Open Access Journals |
| Externí odkaz: |
|
