Innocent strategies as presheaves and interactive equivalences for CCS

Tom Hirschowitz (1) , Damien Pous (2)

1 LAMA - Laboratoire de Mathématiques
2 SARDES - System architecture for reflective distributed computing environments

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 then equip innocent strategies with a simple notion of interaction. This results in an interpretation of CCS. Based on this, 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 prove that the analogues of fair and must testing equivalences coincide, while they differ in the standard setting.

Domaines: Logique en informatique [cs.LO]

Tom Hirschowitz, Damien Pous. Innocent strategies as presheaves and interactive equivalences for CCS. ICE, Jun 2011, Reykjavik, Iceland. pp.2-24, ⟨10.4204/EPTCS.59.2⟩. ⟨hal-00616648⟩