Abstract:
Imposing certain restrictions on the transition system that
defines the behaviour of a process allows us to characterize the readiness
semantics of Olderog and Hoare by means of black-box testing experiments, or
more precisely by the lighted button testing experiments of Bloom and Meyer.
As divergence is considered we give the semantics as a preorder, the
readiness preorder, which kernel coincides with the readiness equivalence of
Olderog and Hoare. This leads to a bisimulation like characterization and a
modal characterization of the semantics. A concrete language, recursive free
CCS without 
, is introduced, a proof system defined and it is shown
to be sound and complete with respect to the readiness preorder. In the
completeness proof the modal characterization plays an important role as it
allows us to prove algebraicity of the preorder purely
operationally
Available as PostScript, PDF, DVI.