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...
| 發表在: | Logical Methods in Computer Science |
|---|---|
| 主要作者: | |
| 格式: | Article |
| 語言: | 英语 |
| 出版: |
Logical Methods in Computer Science e.V.
2014-10-01
|
| 主題: | |
| 在線閱讀: | https://lmcs.episciences.org/1090/pdf |