Abstract
The weightable quasi-pseudo-metric spaces have been introduced by Matthews as part of the study of the denotational semantics of dataflow networks (e.g., [6] and [7]). The study of these spaces has been continued in the context of Nonsymmetric Topology by Künzi and Vajner [4], [5]. We introduce and motivate the class of upper weightable quasi-pseudo-metric spaces. The relationship with the development of a topological foundation for the complexity analysis of programs [10] is discussed, which leads to the study of the weightable optimal (quasi-pseudo-metric) join semilattices.
| Original language | English |
|---|---|
| Pages (from-to) | 348-363 |
| Number of pages | 16 |
| Journal | Annals of the New York Academy of Sciences |
| Volume | 806 |
| DOIs | |
| Publication status | Published - 1996 |
| Externally published | Yes |
Keywords
- (Weightable) quasi-pseudo-metrics
- Complexity
- Directed partial orders
- Join semilattices