Full abstraction for fair testing in CCS (expanded version)
In previous work with Pous, we defined a semantics for CCS which may both be viewed as an innocent form of presheaf semantics and as a concurrent form of game semantics. We define in this setting an analogue of fair testing equivalence, which we prove fully abstract w.r.t. standard fair testing equi...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Logical Methods in Computer Science e.V.
2014-10-01
|
| Series: | Logical Methods in Computer Science |
| Subjects: | |
| Online Access: | https://lmcs.episciences.org/1090/pdf |
| _version_ | 1797268666339819520 |
|---|---|
| author | Tom Hirschowitz |
| author_facet | Tom Hirschowitz |
| author_sort | Tom Hirschowitz |
| collection | DOAJ |
| description | In previous work with Pous, we defined a semantics for CCS which may both be
viewed as an innocent form of presheaf semantics and as a concurrent form of
game semantics. We define in this setting an analogue of fair testing
equivalence, which we prove fully abstract w.r.t. standard fair testing
equivalence. The proof relies on a new algebraic notion called playground,
which represents the `rule of the game'. From any playground, we derive two
languages equipped with labelled transition systems, as well as a strong,
functional bisimulation between them. |
| first_indexed | 2024-04-25T01:36:06Z |
| format | Article |
| id | doaj.art-e985dec546d5432fb4824c5a551f273c |
| institution | Directory Open Access Journal |
| issn | 1860-5974 |
| language | English |
| last_indexed | 2024-04-25T01:36:06Z |
| publishDate | 2014-10-01 |
| publisher | Logical Methods in Computer Science e.V. |
| record_format | Article |
| series | Logical Methods in Computer Science |
| spelling | doaj.art-e985dec546d5432fb4824c5a551f273c2024-03-08T09:37:57ZengLogical Methods in Computer Science e.V.Logical Methods in Computer Science1860-59742014-10-01Volume 10, Issue 410.2168/LMCS-10(4:2)20141090Full abstraction for fair testing in CCS (expanded version)Tom Hirschowitzhttps://orcid.org/0000-0002-7220-4067In previous work with Pous, we defined a semantics for CCS which may both be viewed as an innocent form of presheaf semantics and as a concurrent form of game semantics. We define in this setting an analogue of fair testing equivalence, which we prove fully abstract w.r.t. standard fair testing equivalence. The proof relies on a new algebraic notion called playground, which represents the `rule of the game'. From any playground, we derive two languages equipped with labelled transition systems, as well as a strong, functional bisimulation between them.https://lmcs.episciences.org/1090/pdfcomputer science - logic in computer science |
| spellingShingle | Tom Hirschowitz Full abstraction for fair testing in CCS (expanded version) Logical Methods in Computer Science computer science - logic in computer science |
| title | Full abstraction for fair testing in CCS (expanded version) |
| title_full | Full abstraction for fair testing in CCS (expanded version) |
| title_fullStr | Full abstraction for fair testing in CCS (expanded version) |
| title_full_unstemmed | Full abstraction for fair testing in CCS (expanded version) |
| title_short | Full abstraction for fair testing in CCS (expanded version) |
| title_sort | full abstraction for fair testing in ccs expanded version |
| topic | computer science - logic in computer science |
| url | https://lmcs.episciences.org/1090/pdf |
| work_keys_str_mv | AT tomhirschowitz fullabstractionforfairtestinginccsexpandedversion |