Axiomatizing GSOS with Predicates

TL;DR

This paper extends the GSOS rule format with predicates like termination and divergence, providing a method to automatically generate axiomatizations for bisimilarity and enabling theorem-proving for process equivalences.

Contribution

It introduces an extended GSOS format with predicates and automates the derivation of axiomatizations for bisimilarity, enhancing process verification tools.

Findings

Automated axiomatization generation for extended GSOS systems.

Implementation of a tool for deriving axiomatizations from SOS specifications.

Facilitates theorem-proving for strong bisimilarity in process algebra.

Abstract

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.