Axiomatizing GSOS with Predicates

Luca Aceto
(Reykjavik University, Iceland)
Georgiana Caltais
(Reykjavik University, Iceland)
Eugen-Ioan Goriac
(Reykjavik University, Iceland)
Anna Ingolfsdottir
(Reykjavik University, Iceland)

In this paper, we introduce an extension of the GSOS rule format with predicates such as termination, convergence and divergence. For this format we generalize the technique proposed by Aceto, Bloom and Vaandrager for the automatic generation of ground-complete axiomatizations of bisimilarity over GSOS systems. Our procedure is implemented in a tool that receives SOS specifications as input and derives the corresponding axiomatizations automatically. This paves the way to checking strong bisimilarity over process terms by means of theorem-proving techniques.

In M.A. Reniers and P. Sobocinski: Proceedings Eight Workshop on Structural Operational Semantics 2011 (SOS 2011), Aachen, Germany, 5th September 2011, Electronic Proceedings in Theoretical Computer Science 62, pp. 1–15.
Published: 13th August 2011.

ArXived at: http://dx.doi.org/10.4204/EPTCS.62.1 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org