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

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

2010-02-15

arxiv.org/abs/1002.2864v1

EPTCS 18, 2010, pp. 1-16

Computer Science

Logic in Computer Science

Scientific paper

10.4204/EPTCS.18.1

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.

Affiliated with

Also associated with

No associations

Rating

A Bisimulation-based Method for Proving the Validity of Equations in GSOS Languages does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Bisimulation-based Method for Proving the Validity of Equations in GSOS Languages, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Bisimulation-based Method for Proving the Validity of Equations in GSOS Languages will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-146061