Journal article icon

Journal article

Confluence thanks to extensional determinism

Abstract:
A process is extensionally deterministic if, after any trace s and given any event a, it is either certain to accept or certain to refuse a (stably) after s. We show how several process algebras are capable of expressing this property and how they agree on the equivalence of deterministic processes. A number of important properties of processes P, including confluence, can be captured in terms of the determinism of some context C[P].
Publication status:
Published
Peer review status:
Peer reviewed
Version:
Publisher's version

Actions


Access Document


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

Authors


More by this author
Institution:
University of Oxford
Department:
Mathematical,Physical & Life Sciences Division - Computer Science,Department of
Role:
Author
More from this funder
Funding agency for:
A.W. Roscoe
Publisher:
Elsevier B.V. Publisher's website
Journal:
Electronic Notes in Theoretical Computer Science Journal website
Volume:
162
Pages:
305–309
Publication date:
2006-09-05
DOI:
ISSN:
1571-0661
URN:
uuid:762fc0cc-4c6b-49fb-8a54-0f42236ac22a
Local pid:
ora:8856

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