scientific article; zbMATH DE number 3890714
[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.
- Fair, biased, and self-balancing merge operators: Their specification and implementation in Concurrent Prolog
- Fair constraint merging tableaux in lazy functional programming style
- Merging by Decomposition Revisited
- Merging Logic Programs under Answer Set Semantics
- scientific article; zbMATH DE number 3926234
- scientific article; zbMATH DE number 3960987
- scientific article; zbMATH DE number 1547725
- Merge-and-shrink: a compositional theory of transformations of factored transition systems
- Fair, biased, and self-balancing merge operators: Their specification and implementation in Concurrent Prolog
- Merging regular processes by means of fixed-point theory
- On the consistency of Koomen's fair abstraction rule
- Applications of compactness in the Smyth powerdomain of streams
- Transition systems, metric spaces and ready sets in the semantics of uniform concurrency
- Terminal metric spaces of finitely branching and image finite linear processes
- Linear time and branching time semantics for recursion with merge
- De Bakker-Zucker processes revisited
- Wedge sum, merge and inconsistency
- scientific article; zbMATH DE number 4092750 (Why is no real title available?)
- Generalizing finiteness conditions of labelled transition systems
- Three metric domains of processes for bisimulation
- An introduction to metric semantics: Operational and denotational models for programming and specification languages
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 Q3347277)