Paper Details

%T Infinite Traces, Acceptances and CSPP
%A Adrian E. Lawrence
%E Alan G. Chalmers, Majid Mirmehdi, Henk Muller
%B Communicating Process Architectures 2001
%X There is a long standing problem when infinite traces are
   included in denotational semantic models of CSP. Full models
   fail to be Complete Partial Orders under refinement. This
   paper introduces a novel, but entirely natural, way of
   representing infinite behaviour in which refinement is a
   Complete Partial Order when the alphabet of events is
   finite. Acceptance semantics also solves the problem of
   infinite behaviour with an infinite alphabet. That requires
   a different construction based on a metric space and will be
   described elsewhere.

If you have any comments on this database, including inaccuracies, requests to remove or add information, or suggestions for improvement, the WoTUG web team are happy to hear of them. We will do our best to resolve problems to everyone's satisfaction.

Copyright for the papers presented in this database normally resides with the authors; please contact them directly for more information. Addresses are normally presented in the full paper.