### Abstract

The standard way of lifting a binary relation, R, from closed terms of an algebra to open terms is to define its closed-instance extension, R_{ci}, which holds for a given pair of open terms if and only if R holds for all their closed instantiations. In this paper, we study alternatives for the case of (strong) bisimulation: we define semantic models for open terms, so-called conditional transition systems, and define bisimulation directly on those models. It turns out that this can be done in at least two different ways, giving rise to formal hypothesis bisimulation \sim_{fh} (due to De Simone) and hypothesis-preserving bisimilarity \sim_{hp}. For open terms, we have (strict) inclusions \sim_{fh} \subset \sim_{hp} \subset \sim_{ci}; for closed terms, the three relations coincide. We show that each of these relations is a congruence in the usual sense, and we give an alternative characterisation of \sim_{hp} in terms of non-conditional transitions. Finally, we study the issue of recursive congruence: we give general theorems for the congruence of each of the above variants with respect to the recursion combinator, where, however, the results we achieve for \sim_{fh} and \sim_{hp} hold in a more general setting than the one for \sim_{ci}.

Original language | Undefined |
---|---|

Pages | 262-285 |

Number of pages | 20 |

DOIs | |

Publication status | Published - 1997 |

### Keywords

- IR-66671
- EWI-8312

## Cite this

Rensink, A., Palamidessi, C. (Ed.), & Parrow, J. (Ed.) (1997).

*Bisimilarity of Open Terms*. 262-285. https://doi.org/10.1016/S1571-0661(05)80477-3