Paper Details

Acceptances, Behaviours and Infinite Activity in CSPP

Authors: Lawrence, Adrian E.

Abstract:

The denotational semantics presented here defines an extension of CSP called CSPP. It includes a full description of infinite behaviour in one simple model using only finite traces. This is true for both finite and infinite alphabets. The structure is a complete lattice, and so also a complete partial order, under refinement. Thus recursion is defined by fixed points in the usual way. It is also a complete restriction metric space so this provides an alternative treatment of recursion for contraction mappings.

Proceedings:

Communicating Process Architectures 2002, James Pascoe, Roger Loader, Vaidy Sunderam, 2002, pp 17 - 38 published by IOS Press, Amsterdam

Files: PDF PS

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, and suggestions for improvement, the WoTUG webmaster is happy to hear of them and we will do our best to resolve problems to everones satisfaction.

The papers presented in this database are normally the copyright of the authors. Please refer to the authors directly for more information. Addresses are normally presented in the full paper.