Lifting non-finite axiomatizability results to extensions of process algebras

L. Aceto, W.J. Fokkink, A. Ingólfsdóttir, M. Mousavi

    Research output: Contribution to journalArticleAcademicpeer-review

    5 Citations (Scopus)

    Abstract

    This paper presents a general technique for obtaining new results pertaining to the non-finite axiomatizability of behavioural (pre)congruences over process algebras from old ones. The proposed technique is based on a variation on the classic idea of reduction mappings. In this setting, such reductions are translations between languages that preserve sound (in)equations and (in)equational provability over the source language, and reflect families of (in)equations responsible for the non-finite axiomatizability of the target language. The proposed technique is applied to obtain a number of new non-finite axiomatizability theorems in process algebra via reduction to Moller’s celebrated non-finite axiomatizability result for CCS. The limitations of the reduction technique are also studied. In particular, it is shown that prebisimilarity is not finitely based over CCS with the divergent process O, but that this result cannot be proved by a reduction to the non-finite axiomatizability of CCS modulo bisimilarity. This negative result is the inspiration for the development of a sharpened reduction method that is powerful enough to show that prebisimilarity is not finitely based over CCS with the divergent process O.
    Original languageEnglish
    Pages (from-to)147-177
    JournalActa Informatica
    Volume47
    Issue number3
    DOIs
    Publication statusPublished - 2010

    Fingerprint

    Dive into the research topics of 'Lifting non-finite axiomatizability results to extensions of process algebras'. Together they form a unique fingerprint.

    Cite this