%0 Conference Proceedings
%T Bisimilarity of Open Terms in Stream GSOS
%+ Laboratoire de l'Informatique du Parallélisme (LIP)
%+ Radboud University [Nijmegen]
%A Bonchi, Filippo
%A Lee, Matias, David
%A Rot, Jurriaan
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 7th International Conference on Fundamentals of Software Engineering (FSEN)
%C Teheran, Iran
%Y Mehdi Dastani
%Y Marjan Sirjani
%I Springer International Publishing
%3 Fundamentals of Software Engineering
%V LNCS-10522
%P 35-50
%8 2017-04-26
%D 2017
%R 10.1007/978-3-319-68972-2_3
%Z Computer Science [cs]Conference papers
%X Stream GSOS is a specification format for operations and calculi on infinite sequences. The notion of bisimilarity provides a canonical proof technique for equivalence of closed terms in such specifications. In this paper, we focus on open terms, which may contain variables, and which are equivalent whenever they denote the same stream for every possible instantiation of the variables. Our main contribution is to capture equivalence of open terms as bisimilarity on certain Mealy machines, providing a concrete proof technique. Moreover, we introduce an enhancement of this technique, called bisimulation up-to substitutions, and show how to combine it with other up-to techniques to obtain a powerful method for proving equivalence of open terms.
%G English
%Z TC 2
%Z WG 2.2
%2 https://inria.hal.science/hal-01760851/document
%2 https://inria.hal.science/hal-01760851/file/459025_1_En_3_Chapter.pdf
%L hal-01760851
%U https://inria.hal.science/hal-01760851
%~ ENS-LYON
%~ CNRS
%~ INRIA
%~ UNIV-LYON1
%~ LIP_PLUME
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC2
%~ IFIP-WG2-2
%~ IFIP-FSEN
%~ INRIA2017
%~ IFIP-LNCS-10522
%~ INRIA-AUT
%~ UDL
%~ UNIV-LYON
%~ ANR