Abstract
We present a denotational model for CCS, accounting for finite as well as infinite behaviours. The meanings of programs are combinations of ready sets and infinitary languages. The model is shown fully abstract w.r.t. the equivalence u ∼ v if L(u,t)=L(v,t) for any testing program t, where L(p,q) is the set of totally ordered traces of communications between programs p and q set in parallel.
Get full access to this article
View all access options for this article.