Journal article
Compactness in semantics for merge and fair merge
Abstract
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 …
Authors
de Bakker JW; Zucker JI
Journal
Lecture Notes in Computer Science, Vol. 164, , pp. 18–33
Publisher
Springer Nature
Publication Date
1984
DOI
10.1007/3-540-12896-4_352
ISSN
0302-9743