A Technique for Checking the CSP sat Property
Authors: Martin, Jeremy M. R., Jassim, S. A.
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
Proceedings of WoTUG-21: Architectures, Languages and Patterns for Parallel and Distributed Applications, Peter H. Welch, André W. P. Bakkers, 1998, pp 93 - 110 published by IOS Press, AmsterdamFiles: PS, PDF
This record in other formats:Web page: BibTEX, Refer
Plain text: BibTEX, Refer
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.
Pages © WoTUG, or the indicated author. All Rights Reserved.
Comments on these web pages should be addressed to: www at wotug.org