On timed models and full abstraction
In this paper we study a denotational model for a discrete-time version of CSP. We give a compositional semantics for the language. The model records refusal information at the end of each time unit; we believe this model to be simpler than existing models. We also show that the model is fully abstract: equivalence in the model corresponds to the natural equivalence of may testing; and all members of the denotational model are syntactically expressible. We also consider a slightly weaker m...Expand abstract
- Publication status:
- Peer review status:
- Peer reviewed
(Version of record, pdf, 415.0KB)
- Publisher copy:
- Copyright holder:
- Copyright date:
© 2006 Elsevier B.V.
Open access under CC BY-NC-ND license.
If you are the owner of this record, you can report an update to it here: Report update to this record