DeepAI
Log In Sign Up

Bisimilarity of Open Terms in Stream GSOS

11/08/2018
by   Filippo Bonchi, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

04/06/2020

Formal Verification of Flow Equivalence in Desynchronized Designs

Seminal work by Cortadella, Kondratyev, Lavagno, and Sotiriou includes a...
03/29/2022

Graded Monads and Behavioural Equivalence Games

The framework of graded semantics uses graded monads to capture behaviou...
10/27/2022

Reductions in Higher-Order Rewriting and Their Equivalence

Proof terms are syntactic expressions that represent computations in ter...
08/16/2017

A fix-point characterization of Herbrand equivalence of expressions in data flow frameworks

The problem of determining Herbrand equivalence of terms at each program...
01/14/2020

On Equivalence and Cores for Incomplete Databases in Open and Closed Worlds

Data exchange heavily relies on the notion of incomplete database instan...
08/10/2022

Verification of the busy-forbidden protocol (using an extension of the cones and foci framework)

The busy-forbidden protocol is a new readers-writer lock with no resourc...
02/16/2022

Guessing with Little Data

Reconstructing a hypothetical recurrence equation from the first terms o...