Salvador Romaguera

Learn More
Stable partial metric spaces (or the equivalent invariant weightable quasi-metric spaces) form a fundamental concept in Quantitative Domain Theory. Indeed, all domains have been shown to be quantifiable via a stable partial metric (e.g. [22], [23], [26]). Monoid operations arise in Domain Theory in the context of power domains. These operations also arise(More)
Recently, E.A. Emerson and C.S. Jutla (SIAM J. Comput., 1999), have successfully applied complexity of tree automata to obtain optimal deterministic exponential time algorithms for some important modal logics of programs. The running time of these algorithms corresponds, of course, to complexity functions which are potential functions and, thus, they do not(More)