On timed models and full abstraction
<p>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 fu...
| Main Authors: | , |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
2006
|
| Subjects: |