Innocent strategies as presheaves and interactive equivalences for CCS (expanded version)

Tom Hirschowitz 1 Damien Pous 2, 3
2 SARDES - System architecture for reflective distributed computing environments
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
3 PLUME - Preuves et Langages
LIP - Laboratoire de l'Informatique du Parallélisme
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.
Type de document :
Article dans une revue
Scientific Annals of Computer Science, Alexandru Ioan Cuza University Publishing House, 2012, 22 (1), pp.147-199. <10.7561/SACS.2012.1.147>
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00555144
Contributeur : Tom Hirschowitz <>
Soumis le : mercredi 12 décembre 2012 - 09:45:47
Dernière modification le : vendredi 3 juin 2016 - 01:06:26
Document(s) archivé(s) le : dimanche 18 décembre 2016 - 00:05:21

Fichiers

main.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Tom Hirschowitz, Damien Pous. Innocent strategies as presheaves and interactive equivalences for CCS (expanded version). Scientific Annals of Computer Science, Alexandru Ioan Cuza University Publishing House, 2012, 22 (1), pp.147-199. <10.7561/SACS.2012.1.147>. <hal-00555144v3>

Partager

Métriques

Consultations de
la notice

440

Téléchargements du document

148