%T Semantics of prialt in Handel\-C (tm)
%A Andrew Butterfield
%E James S. Pascoe, Roger J. Loader, Vaidy S. Sunderam
%B Communicating Process Architectures 2002
%X This paper discusses the semantics of the prialt construct
in Handel\-C. The language is essentially a static subset of
C, augmented with a parallel construct and channel
communication, as found in CSP. All assignments and channel
communication events take one clock cycle, with all updates
synchronised with the clock edge marking the cycle end. The
behaviour of prialt in Handel\-C is similar in concept to
that of occam, and to the p\-priority concept of Adrian
Lawrence\[rs]s CSPP. However, we have to contend with both
input and output guards in Handel\-C, unlike the situation
in occam, although prialts with conflicting priority
requirements are not legal in Handel\-C. This makes our
problem simpler than the more general case including such
conflicts considered by Lawrence. We start with an informal
discussion of the issues that arise when considering the
semantics of Handel\-C\[rs]s prialt construct. We define a
resolution function (R) that determines which requests in a
collection of prialts become active. We describe a few
properties that we expect to hold for resolution, and
discuss the issue of compositionality.
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