Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network

  Advanced Search  

Submitted to: c L. Aceto, G. Caltais, E.-I. Goriac, A. Ingolfsdottir

Summary: Submitted to:
SOS 2011
c L. Aceto, G. Caltais, E.-I. Goriac, A. Ingolfsdottir
This work is licensed under the
Creative Commons Attribution License.
Axiomatizing GSOS with Predicates
Luca Aceto Georgiana Caltais Eugen-Ioan Goriac Anna Ingolfsdottir
ICE-TCS, School of Computer Science, 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-completeaxiomatizations 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.
1 Introduction
One of the greatest challenges in computer science is the development of rigorous methods for the speci-
fication and verification of reactive systems, i.e., systems that compute by interacting with their environ-
ment. Typical examples include embedded systems, control programs and distributed communication
protocols. Over the last three decades, process algebras, such as ACP [4], CCS [15] and CSP [13],


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


Collections: Mathematics; Computer Technologies and Information Sciences