scientific article; zbMATH DE number 4041249

From MaRDI portal
Publication:3779734





[For the entire collection see Zbl 0616.00013.] A syntax-directed compositional denotational semantics for nondeterministic broadcast networks is presented. The semantics is based on the spectrum of semantic models ranging from interleaving to maximum parallelism semantics developed earlier for a real-time variant of CSP. Broadly we consider two classes of broadcast communications namely - unbuffered broadcast - buffered broadcast - unbounded buffers - bounded buffers - with the condition that the transmission is immediate in the sense that the message need not be sent over all the designated channels. - bounded buffers - with the condition that the message is sent to all the channels as and when a buffer becomes available. - atomic broadcast - initiation is delayed till each channel has at least one buffer for the message. In other words, broadcast networks have been characterized based on characteristics such as buffer availability, reliable/lossy transmission, and immediate/delayed initiation. One of the central aspects that can be inferred from the semantics is that the distinguishing features of the various broadcast schemes are observable only in real-time models. Conversely, it also reflects on the inherent suitability of broadcast schemes for real-time programming.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3779734)