No label defined (Q3347277)
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 3890714
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3890714 |
Statements
1984
0 references
compactness
0 references
semantics
0 references
fair merge operations
0 references
hyperspaces
0 references
bounded nondeterminacy
0 references
fair processes
0 references
0.83302647
0 references
0.82856107
0 references
0 references
0.8213632
0 references
[For the entire collection see Zbl 0533.00026.] An analysis of the role of compactness in defining the semantics of the merge and fair merge operations is provided. In a suitable context of hyperspaces (sets of subsets) a set is compact iff it is the limit of a sequence of finite sets; hence, compactness generalises bounded nondeterminacy. The merge operation is investigated in the setting of a simple language with elementary actions, sequential composition, nondeterministic choice and recursion. Metric topology is used as a framework to assign both a linear time and a branching time semantics to this language. It is then shown that the resulting meanings are compact trace sets and compact processes, respectively. This result complements previous work by De Bakker, Bergstra, Klop and Meyer. For the fair merge, an approach using scheduling through random choices is adopted - since a direct definition precludes the use of closed, let alone of compact sets. In the indirect approach, a compactness condition is used to show that the fair merge of two fair processes yields a fair process.
0 references