- 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:
- Peer review status:
- Peer reviewed
- Publisher's version
- Copyright holder:
- Elsevier B.V.
- Copyright date:
- © 2006 Elsevier B.V. Under a Creative Commons license (http://creativecommons.org/licenses/by-nc-nd/3.0/).
Confluence thanks to extensional determinism
Views and Downloads
If you are the owner of this record, you can report an update to it here: Report update to this record