BIROn - Birkbeck Institutional Research Online

    On finite alphabets and infinite bases III: simulation

    Chen, Taolue and Fokkink, W.J. (2006) On finite alphabets and infinite bases III: simulation. In: Baier, C. and Hermanns, H. (eds.) CONCUR 2006: Concurrency Theory: 17th International Conference. Lecture Notes in Computer Science 4137. Springer, pp. 421-434. ISBN 9783540373766.

    Full text not available from this repository.

    Abstract

    This paper studies the (in)equational theory of simulation preorder and equivalence over the process algebra BCCSP. We prove that in the presence of a finite alphabet with at least two actions, the (in)equational theory of BCCSP modulo simulation preorder or equivalence does not have a finite basis. In contrast, in the presence of an alphabet that is infinite or a singleton, the equational theory for simulation equivalence does have a finite basis.

    Metadata

    Item Type: Book Section
    School: School of Business, Economics & Informatics > Computer Science and Information Systems
    Depositing User: Sarah Hall
    Date Deposited: 09 Feb 2021 18:38
    Last Modified: 09 Feb 2021 18:58
    URI: https://eprints.bbk.ac.uk/id/eprint/42955

    Statistics

    Downloads
    Activity Overview
    0Downloads
    13Hits

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item