A Bisimulation-based Method for Proving the Validity of Equations in GSOS Languages

Luca Aceto
(Reykjavik University)
Matteo Cimini
(Reykjavik University)
Anna Ingolfsdottir
(Reykjavik University)

This paper presents a bisimulation-based method for establishing the soundness of equations between terms constructed using operations whose semantics is specified by rules in the GSOS format of Bloom, Istrail and Meyer. The method is inspired by de Simone's FH-bisimilarity and uses transition rules as schematic transitions in a bisimulation-like relation between open terms. The soundness of the method is proven and examples showing its applicability are provided. The proposed bisimulation-based proof method is incomplete, but the article offers some completeness results for restricted classes of GSOS specifications.

In Bartek Klin and Paweł Sobociński: Proceedings Sixth Workshop on Structural Operational Semantics (SOS 2009), Bologna, Italy, August 31, 2009, Electronic Proceedings in Theoretical Computer Science 18, pp. 1–16.
Published: 15th February 2010.

ArXived at: https://dx.doi.org/10.4204/EPTCS.18.1 bibtex PDF

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org