Innocent strategies as presheaves and interactive equivalences for CCS

Details Innocent strategies as presheaves and interactive equivalences for CCS Innocent strategies as presheaves and interactive equivalences for CCS

2011-08-02

arxiv.org/abs/1108.0463v1

EPTCS 59, 2011, pp. 2-24

Computer Science

Logic in Computer Science

In Proceedings ICE 2011, arXiv:1108.0144

Scientific paper

10.4204/EPTCS.59.2

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.

Affiliated with

Also associated with

No associations

Rating

Innocent strategies as presheaves and interactive equivalences for CCS does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Innocent strategies as presheaves and interactive equivalences for CCS, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Innocent strategies as presheaves and interactive equivalences for CCS will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-508361