Academic Journals Database
Disseminating quality controlled scientific knowledge

Innocent Strategies as Presheaves and Interactive Equivalences for CCS

ADD TO MY LIST
 
Author(s): T. Hirschowitz | D. Pous

Journal: Scientific Annals of Computer Science
ISSN 1843-8121

Volume: 22;
Issue: 1;
Start page: 147;
Date: 2012;
VIEW PDF   PDF DOWNLOAD PDF   Download PDF Original page

Keywords: programming language semantics | concurrency | presheaf models | game semantics | behavioural equivalences | fair testing

ABSTRACT
Seeking a general framework for reasoning about and comparing programming languages, we derive a new view of Milner's CCS. We construct a category E of plays, and a subcategory V of views. We argue that presheaves on V adequately represent innocent strategies, in the sense of game semantics. We equip innocent strategies with a simple notion of interaction.We then prove decomposition results for innocent strategies, and, restricting to presheaves of finite ordinals, prove that innocent strategies are a final coalgebra for a polynomial functor derived from the game. This leads to a translation of CCS with recursive equations.Finally, we propose a notion of interactive equivalence for innocent strategies, which is close in spirit to Beffara's interpretation of testing equivalences in concurrency theory. In this framework, we consider analogues of fair testing and must testing. We show that must testing is strictly finer in our model than in CCS, since it avoids what we call `spatial unfairness'. Still, it differs from fair testing, and we show that it coincides with a relaxed form of fair testing.
RPA Switzerland

RPA Switzerland

Robotic process automation

    

Tango Jona
Tangokurs Rapperswil-Jona