Paper Details

%T A Technique for Checking the CSP sat Property
%A Jeremy M. R. Martin, S. A. Jassim
%E Peter H. Welch, André W. P. Bakkers
%B Proceedings of WoTUG\-21: Architectures, Languages and Patterns for Parallel and Distributed Applications
%X This paper presents an algorithm for checking that a CSP
   process satisfies a specification defined by a
   boolean\-valued function on its traces and refusals, i.e. P
   sat f(tr, ref) This is contrasted with the refinement
   approach, as implemented by the FDR tool, of checking that
   one CSP process is a possible implementation of another,
   i.e. P >= SPEC

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.