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
Actions
Access Document
- Files:
-
-
(Preview, Version of record, pdf, 173.1KB, Terms of use)
-
- Publisher copy:
- 10.1016/j.entcs.2005.12.098
Authors
- Publisher:
- Elsevier
- Journal:
- Electronic Notes in Theoretical Computer Science More from this journal
- Volume:
- 162
- Pages:
- 305–309
- Publication date:
- 2006-09-01
- Edition:
- Publisher's version
- DOI:
- ISSN:
-
1571-0661
- Language:
-
English
- Keywords:
- Subjects:
- UUID:
-
uuid:762fc0cc-4c6b-49fb-8a54-0f42236ac22a
- Local pid:
-
ora:8856
- Deposit date:
-
2014-08-01
Terms of use
- Copyright holder:
- Elsevier BV
- Copyright date:
- 2006
- Notes:
- © 2006 Elsevier B.V. Under a Creative Commons license (http://creativecommons.org/licenses/by-nc-nd/3.0/).
If you are the owner of this record, you can report an update to it here: Report update to this record