Towards a satisfaction relation between CCS specifications and their refinements
The thesis is concerned with the application and applicability of CCS and, in particular, the problem of establishing a satisfaction relation between specifications and their refinements in CCS. The problems encountered arise from the instability which in general results when agents are composed and certain actions restricted. Bisimulation proves to be elusive in the presence of leading r's in an expansion. Testing equivalence, the conjunction of may and must equivalences, is investigated. May testing is unaffected by either divergence or internal nondeterminism; must testing is affected by both. This is similarly hard to establish.