No label defined (Q3779734)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4041249
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4041249 |
Statements
1987
0 references
denotational semantics
0 references
nondeterministic broadcast networks
0 references
broadcast communications
0 references
real-time programming
0 references
0.899535596370697
0 references
0.7267650961875916
0 references
[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.
0 references