Innocent strategies as presheaves and interactive equivalences for CCS
In Proceedings ICE 2011, arXiv:1108.0144 International audience 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 r...
Published in: | Electronic Proceedings in Theoretical Computer Science |
---|---|
Main Authors: | , |
Other Authors: | , , , , , |
Format: | Conference Object |
Language: | English |
Published: |
HAL CCSD
2011
|
Subjects: | |
Online Access: | https://hal.archives-ouvertes.fr/hal-00616648 https://doi.org/10.4204/EPTCS.59.2 |
id |
ftccsdartic:oai:HAL:hal-00616648v1 |
---|---|
record_format |
openpolar |
spelling |
ftccsdartic:oai:HAL:hal-00616648v1 2023-05-15T16:49:19+02:00 Innocent strategies as presheaves and interactive equivalences for CCS Hirschowitz, Tom Pous, Damien Laboratoire de Mathématiques (LAMA) Université Savoie Mont Blanc (USMB Université de Savoie Université de Chambéry )-Centre National de la Recherche Scientifique (CNRS) System architecture for reflective distributed computing environments (SARDES) Inria Grenoble - Rhône-Alpes Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'Informatique de Grenoble (LIG) Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF) Reykjavik, Iceland 2011-06-09 https://hal.archives-ouvertes.fr/hal-00616648 https://doi.org/10.4204/EPTCS.59.2 en eng HAL CCSD info:eu-repo/semantics/altIdentifier/arxiv/1108.0463 info:eu-repo/semantics/altIdentifier/doi/10.4204/EPTCS.59.2 hal-00616648 https://hal.archives-ouvertes.fr/hal-00616648 ARXIV: 1108.0463 doi:10.4204/EPTCS.59.2 ICE https://hal.archives-ouvertes.fr/hal-00616648 ICE, Jun 2011, Reykjavik, Iceland. pp.2-24, ⟨10.4204/EPTCS.59.2⟩ [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO] info:eu-repo/semantics/conferenceObject Conference papers 2011 ftccsdartic https://doi.org/10.4204/EPTCS.59.2 2021-10-24T17:35:00Z In Proceedings ICE 2011, arXiv:1108.0144 International audience 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. Conference Object Iceland Archive ouverte HAL (Hyper Article en Ligne, CCSD - Centre pour la Communication Scientifique Directe) Electronic Proceedings in Theoretical Computer Science 59 2 24 |
institution |
Open Polar |
collection |
Archive ouverte HAL (Hyper Article en Ligne, CCSD - Centre pour la Communication Scientifique Directe) |
op_collection_id |
ftccsdartic |
language |
English |
topic |
[INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO] |
spellingShingle |
[INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO] Hirschowitz, Tom Pous, Damien Innocent strategies as presheaves and interactive equivalences for CCS |
topic_facet |
[INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO] |
description |
In Proceedings ICE 2011, arXiv:1108.0144 International audience 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. |
author2 |
Laboratoire de Mathématiques (LAMA) Université Savoie Mont Blanc (USMB Université de Savoie Université de Chambéry )-Centre National de la Recherche Scientifique (CNRS) System architecture for reflective distributed computing environments (SARDES) Inria Grenoble - Rhône-Alpes Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'Informatique de Grenoble (LIG) Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF) |
format |
Conference Object |
author |
Hirschowitz, Tom Pous, Damien |
author_facet |
Hirschowitz, Tom Pous, Damien |
author_sort |
Hirschowitz, Tom |
title |
Innocent strategies as presheaves and interactive equivalences for CCS |
title_short |
Innocent strategies as presheaves and interactive equivalences for CCS |
title_full |
Innocent strategies as presheaves and interactive equivalences for CCS |
title_fullStr |
Innocent strategies as presheaves and interactive equivalences for CCS |
title_full_unstemmed |
Innocent strategies as presheaves and interactive equivalences for CCS |
title_sort |
innocent strategies as presheaves and interactive equivalences for ccs |
publisher |
HAL CCSD |
publishDate |
2011 |
url |
https://hal.archives-ouvertes.fr/hal-00616648 https://doi.org/10.4204/EPTCS.59.2 |
op_coverage |
Reykjavik, Iceland |
genre |
Iceland |
genre_facet |
Iceland |
op_source |
ICE https://hal.archives-ouvertes.fr/hal-00616648 ICE, Jun 2011, Reykjavik, Iceland. pp.2-24, ⟨10.4204/EPTCS.59.2⟩ |
op_relation |
info:eu-repo/semantics/altIdentifier/arxiv/1108.0463 info:eu-repo/semantics/altIdentifier/doi/10.4204/EPTCS.59.2 hal-00616648 https://hal.archives-ouvertes.fr/hal-00616648 ARXIV: 1108.0463 doi:10.4204/EPTCS.59.2 |
op_doi |
https://doi.org/10.4204/EPTCS.59.2 |
container_title |
Electronic Proceedings in Theoretical Computer Science |
container_volume |
59 |
container_start_page |
2 |
op_container_end_page |
24 |
_version_ |
1766039473315905536 |