Lifting non-finite axiomatizability results to extensions of process algebras

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

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

    Abstract

    This paper presents a general technique for obtaining new results pertaining to the non-finite axiomatizability of behavioral semantics 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 proofs 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. This paper presents a general technique for obtaining new results pertaining to the non-finite axiomatizability of behavioral semantics 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 proofs 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.
    Original languageEnglish
    Title of host publicationFifth IFIP International Conference on Theoretical Computer Science - TCS 2008 (IFIP 20th World Computer Congress, TC1, Foundations of Computer Science, Milano, Italy, September 7-10, 2008, Proceedings)
    EditorsG. Ausiello, J. Karhumäki, G. Mauri, L. Ong
    Place of PublicationBoston
    PublisherSpringer
    Pages301-316
    ISBN (Print)978-0-387-09679-7
    DOIs
    Publication statusPublished - 2008

    Publication series

    NameIFIP Conference Proceedings
    Volume273
    ISSN (Print)1571-5736

    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