Journal article icon

Journal article

On timed models and full abstraction

Abstract:

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:
Published
Peer review status:
Peer reviewed
Version:
Publisher's version

Actions


Access Document


Files:
Publisher copy:
10.1016/j.entcs.2005.11.070

Authors


More by this author
Institution:
University of Oxford
Department:
Mathematical,Physical & Life Sciences Division - Computer Science,Department of
Role:
Author
More by this author
Institution:
University of Oxford
Department:
Mathematical,Physical & Life Sciences Division - Computer Science,Department of
Role:
Author
Journal:
Electronic notes in theoretical computer science Journal website
Volume:
155
Pages:
497–519
Publication date:
2006-05-05
DOI:
ISSN:
1571-0661
URN:
uuid:d600093f-b961-484a-8ce8-f3e521316452
Local pid:
ora:10599

Terms of use


Metrics


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP