A survey of topological work at CEOL

Homeira Pajoohesh; M. P. Schellekens

Home/Archive/arXiv

arXiv · math/0412556

A survey of topological work at CEOL

Homeira Pajoohesh·M. P. Schellekens

View original source ↗Read source document ↗Export metadata ↓

Abstract

We present an overview of ongoing work at the Centre for Efficiency-Oriented languages (CEOL), with a focus on topological aspects. CEOL researchers are engaged in designing a new Real-Time Language to improve software timing. The centre broadly focuses on bridging Semantics and Complexity and unites researchers with expertise in Semantics of Programming Languages, Real-Time Languages, Compiler Design and Graph Based Algorithms. CEOL aims to narrow the gap between Worst Case Execution Time analysis and Average Case Execution Time analysis for Real-Time languages and its longer term goal is the development of ACETT, an Average Case Execution Time Tool. This research work is of crucial interest to industry, given that real-time software is widely used in a variety of applications, such as chemical plants, satellite communications, the space industry, telephone exchanges, medical equipment, the motor industry, etc. Topological work at CEOL focuses on the exploration of quantitative Domains, semivaluations, partial metrics and their applications. We give an overview of prior results obtained at CEOL in this area and of current work on relating the notion of balance of algorithms to running time and of an exploration of semivaluations in relation to algorithmic running time.

Explore related subjects

math.GN

Keep this discovery

BibTeX RIS

Homeira Pajoohesh, M. P. Schellekens. 2004-12-31. A survey of topological work at CEOL. https://arxiv.org/abs/math/0412556

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Maximal Center of Distances of Finite Ultrametric Spaces and Perfect Binary Trees

We investigate the finite ultrametric spaces $(X,d)$ that have a given cardinality of the center of distances and a minimal cardinality of the set $X$. It is shown that such spaces are isometric if and only if their centers of distances are the same. The representing trees of these spaces are characterized up to isomorphism.

math.GN↗

arXiv2026

A continuous $3$-distributive frame that is not $\omega$-distributive

We give a negative answer to the question, posed by Ern\'e, whether every $3$-distributive lattice is $\omega$-distributive. More precisely, we exhibit a continuous frame that is $\kappa$-distributive for every integer $\kappa\geq 2$, but is not a wide coframe. The frame is the open-set lattice of a compact, locally compact, countably based $T_0$ topological meet-semilattice, obtained from Lawson's construction in the logarithmic form described by Goubault-Larrecq. The failure of $\omega$-distributivity is witnessed by an explicit matrix with countably many nonempty finite rows: all row joins are the same nonzero element, whereas every choice of one entry from each row has meet zero. The same space answers negatively Ern\'e's accompanying question whether every $4$-web space is a wide web space. All properties of the construction needed for these conclusions are proved directly.

math.GN↗

arXiv2026

An overlooked weakening of perfect normality: Perfect regularity in spaces and locales

We introduce the notion of perfect regularity as an appropriate weakening of perfect normality, both for spaces and locales. Various characterizations are given, using Dedekind-MacNeille completions, injective hulls, and sublocales. We place the new class of perfectly regular frames among various well-studied classes of frames. We also introduce the construction of perfect regularization of a completely regular frame, compare it to Isbell's well-known booleanization construction, and argue that it is at least as important as the latter.

math.GN↗