Axiomatizing GSOS with termination

J.C.M. Baeten, E.P. Vink, de

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

7 Citations (Scopus)

Abstract

We discuss a combination of GSOS-type structural operational semantics with explicit termination, that we call the tagh-format (tagh being short for termination and GSOS hybrid).The tagh-format distinguishes between transition and termination rules, but allows besides active and negative premises as in GSOS, also for, what is called terminating and passive arguments. We extend the result of Aceto, Bloom and Vaandrager on the automatic generation of sound and complete axiomatizations for GSOSto the setting of tagh-transition system specifications.The construction of the equational theory is based upon the notion of a smooth and distinctive operation, which have been generalized from GSOS to tagh.The examples provided indicate a signifi- cant improvement over the mechanical axiomatization techniques known so far.
Original languageEnglish
Title of host publicationProceedings 19th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2002, Antibes - Juan-les-Pins, France, March 14-16, 2002)
EditorsH. Alt, A. Ferreira
Place of PublicationBerlin
PublisherSpringer
Pages583-595
ISBN (Print)3-540-43283-3
DOIs
Publication statusPublished - 2002

Publication series

NameLecture Notes in Computer Science
Volume2285
ISSN (Print)0302-9743

Fingerprint

Dive into the research topics of 'Axiomatizing GSOS with termination'. Together they form a unique fingerprint.

Cite this