Repository landing page

We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
oaioai:episciences.org:lmcs:1090

Full abstraction for fair testing in CCS (expanded version)

Authors
Publication date
31 October 2014
Publisher
Doi

    Abstract

    In previous work with Pous, we defined a semantics for CCS which may both beviewed as an innocent form of presheaf semantics and as a concurrent form ofgame semantics. We define in this setting an analogue of fair testingequivalence, which we prove fully abstract w.r.t. standard fair testingequivalence. The proof relies on a new algebraic notion called playground,which represents the `rule of the game'. From any playground, we derive twolanguages equipped with labelled transition systems, as well as a strong,functional bisimulation between them.Comment: 80 page

    Similar works

    Full text

    thumbnail-image

    Episciences.org

    redirect
    oaioai:episciences.org:lmcs:1090
    Last time updated on 02/12/2023

    This paper was published in Episciences.org.

    Having an issue?

    Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.