Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Under consideration for publication in Math. Struct. in Comp. Science Proving the validity of equations in GSOS
 

Summary: Under consideration for publication in Math. Struct. in Comp. Science
Proving the validity of equations in GSOS
languages using rule-matching bisimilarity
LUCA ACETO, MATTEO CIMINI and ANNA INGOLFSDOTTIR
School of Computer Science, Reykjavik University, Menntavegur 1, Nauth´olsv´ik,
IS-101 Reykjav´ik, Iceland
Received 18 October 2010
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. An extension of the proof method to the
setting of GSOS languages with predicates is also offered.
1. Introduction
Equations play a fundamental role in the development of the theory and practice of pro-
cess calculi and programming languages since they offer a mathematically appealing and
concise way of stating the `laws of programming' (to borrow the title of a paper by Hoare

  

Source: Aceto, Luca - School of Computer Science, Reykjavík University

 

Collections: Mathematics; Computer Technologies and Information Sciences