A Bisimulation-based Method for Proving the Validity of Equations in GSOS Languages
Luca Aceto, Matteo Cimini, Anna Ingolfsdottir
Electronic Proceedings in Theoretical Computer Science · 2010
doi:10.4204/eptcs.18.1 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
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.
Abstract licence: CC BY-NC-ND
References47
47 more references, whose wording the paper’s licence keeps private.
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.