Confluence Thanks to Extensional Determinism

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....

Full description

Saved in:
Bibliographic Details
Published in:Electronic notes in theoretical computer science 2006-09, Vol.162, p.305-309
Main Author: Roscoe, A.W.
Format: Article
Language:English
Subjects:
CCS
confluence
CSP
determinism
process algebra
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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].
ISSN:1571-0661
1571-0661
DOI:10.1016/j.entcs.2005.12.098