Skip Navigation

The Computer Journal 2000 43(1):13-23; doi:10.1093/comjnl/43.1.13
© 2000 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Martin, J. M. R.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

A Tool for Checking the CSP sat Property

Jeremy M. R. Martin1

1 Oxford Supercomputing Centre, Wolfson Building, Parks Road, Oxford OX1 3QD, UK Email: jeremy.martin@computing-services.oxford.ac.uk

This paper describes an algorithm and associated tool for checking a network of communicating processes, defined using the algebraic language of CSP, against a set-theoretic specification, expressed in terms of event traces and refusal sets.

Received 20 August, 1998. Revised 18 October, 1999.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.