Bisimilarity of open terms in stream GSOS

DOI10.1007/978-3-319-68972-2_3MaRDI QIDQ2093149zbMATH OpenOpenAlexFDO

Authors Filippo Bonchi, Matias David Lee, Jurriaan Rot

Publication date 4 November 2022

Full work available at URL https://arxiv.org/abs/1811.03606

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Abstract: 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.

Recommendations

• Bisimilarity of open terms.
• scientific article; zbMATH DE number 1231603
• Bisimilarity congruences for open terms and term graphs via tile logic
• Proving the validity of equations in GSOS languages using rule-matching bisimilarity
• A bisimulation-based method for proving the validity of equations in GSOS languages

Cited in

(3)

• Proving the validity of equations in GSOS languages using rule-matching bisimilarity
• scientific article; zbMATH DE number 1231603 (Why is no real title available?)
• A bisimulation-based method for proving the validity of equations in GSOS languages

This page was built for publication: Bisimilarity of open terms in stream GSOS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2093149)