No label defined (Q3313252)
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 3843129
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3843129 |
Statements
1983
0 references
denotational semantics
0 references
nondeterminism
0 references
temporal logic
0 references
complete partial orders
0 references
powerdomains
0 references
nondeterministic computations
0 references
modal operators
0 references
0.8938086032867432
0 references
[For the entire collection see Zbl 0513.00010.] This paper shows a simple connection between powerdomains and modal assertions that can be made about nondeterministic computations. It considers three kinds of powerdomains, the Plotkin powerdomain, the Smyth powerdomain and one christened the Hoare powerdomain by Plotkin because it captures the partial correctness of a nondeterministic program. The modal operators are \(\square\) for ''inevitably'' and \(\diamond\) for ''possibly''. It is shown in a precise sense how the Smyth powerdomain is built up from assertions about the inevitable behaviour of a process, the Hoare powerdomain is built up from assertions about the possible behaviour of a process while the Plotkin powerdomain is built up from both kinds of assertions taken together.
0 references