Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
This is a preliminary version of a paper that will appear in Electronic Proceedings
 

Summary: This is a preliminary version of a paper
that will appear in Electronic Proceedings
in Theoretical Computer Science.
c Aceto, Cimini and Ingolfsdottir
This work is licensed under the Creative Commons
Attribution-Noncommercial-No Derivative Works License.
A Bisimulation-based Method for Proving the Validity of
Equations in GSOS Languages
Luca Aceto Matteo Cimini Anna Ingolfsdottir
School of Computer Science, Reykjavik University,
Kringlan 1, IS-103 Reykjavik, Iceland
{luca, matteo, annai}@ru.is
This paper presents a bisimulation-based method for establishing the soundness of equations be-
tween 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 tran-
sition rules as schematic transitions in a bisimulation-like relation between open terms. The sound-
ness 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.

  

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

 

Collections: Mathematics; Computer Technologies and Information Sciences