Results 11 
16 of
16
A Theory of Metric Labelled Transition Systems
 Papers on General Topology and Applications: 11th Summer Conference at the University of Southern Maine, volume 806 of Annals of the New York Academy of Sciences
, 1995
"... Labelled transition systems are useful for giving semantics to programming languages. Kok and Rutten have developed some theory to prove semantic models defined by means of labelled transition systems to be equal to other semantic models. Metric labelled transition systems are labelled transition sy ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Labelled transition systems are useful for giving semantics to programming languages. Kok and Rutten have developed some theory to prove semantic models defined by means of labelled transition systems to be equal to other semantic models. Metric labelled transition systems are labelled transition systems with the configurations and actions endowed with metrics. The additional metric structure allows us to generalize the theory developed by Kok and Rutten. Introduction The classical result due to Banach [Ban22] that a contractive function from a nonempty complete metric space to itself has a unique fixed point plays an important role in the theory of metric semantics for programming languages. Metric spaces and Banach's theorem were first employed by Nivat [Niv79] to give semantics to recursive program schemes. Inspired by the work of Nivat, De Bakker and Zucker [BZ82] gave semantics to concurrent languages by means of metric spaces. The metric spaces they used were defined as solutio...
De BakkerZucker Processes Revisited
 INFORMATION AND COMPUTATION
, 1999
"... The sets of compact and of closed subsets of a metric space endowed with the Hausdorff metric are studied. Both give rise to a functor on the category of 1bounded metric spaces and nonexpansive functions. It is shown that the former functor has a terminal coalgebra and that the latter does not. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The sets of compact and of closed subsets of a metric space endowed with the Hausdorff metric are studied. Both give rise to a functor on the category of 1bounded metric spaces and nonexpansive functions. It is shown that the former functor has a terminal coalgebra and that the latter does not.
The 11th ICGI Learning of Biω Languages from Factors
"... De la Higuera and Janodet (2001) gave a polynomial algorithm that identifies the class of safe ωlanguages which is a subclass of deterministic ωlanguages from positive and negative prefixes. As an extension of this work we study the learning of the family of biω languages. ..."
Abstract
 Add to MetaCart
De la Higuera and Janodet (2001) gave a polynomial algorithm that identifies the class of safe ωlanguages which is a subclass of deterministic ωlanguages from positive and negative prefixes. As an extension of this work we study the learning of the family of biω languages.
Contents
, 2007
"... Klíma Systém pro vektorizaci rastrov´ych obrázk˚u System for Image Vectorization Katedra softwarového inˇzen´yrství ..."
Abstract
 Add to MetaCart
Klíma Systém pro vektorizaci rastrov´ych obrázk˚u System for Image Vectorization Katedra softwarového inˇzen´yrství
Origins of our Theory of Computation on Abstract Data Types at the Mathematical Centre, Amsterdam, 197980
"... With gratitude, admiration and affection In 1979 the authors (hereafter JVT and JIZ) began our work together on developing a theory of computation that works for any data. We were members of Jaco de Bakker’s ..."
Abstract
 Add to MetaCart
With gratitude, admiration and affection In 1979 the authors (hereafter JVT and JIZ) began our work together on developing a theory of computation that works for any data. We were members of Jaco de Bakker’s
AND
"... Abstract. Four semantics for a small programming language involving unbounded (but countable) nondeterminism are provided. These comprise an operational semantics, two state transformation semantics based on the EgliMilner and Smyth orders, respectively, and a weakest precondition semantics. Their ..."
Abstract
 Add to MetaCart
Abstract. Four semantics for a small programming language involving unbounded (but countable) nondeterminism are provided. These comprise an operational semantics, two state transformation semantics based on the EgliMilner and Smyth orders, respectively, and a weakest precondition semantics. Their equivalence is proved. A Hoarelike proof system for total correctness is also introduced and its soundness and completeness in an appropriate sense are shown. Finally, the recursion theoretic complexity of the notions introduced is studied. Admission of countable nondeterminism results in a lack of continuity of various semantic functions, and this is shown to be necessary for any semantics satisfying appropriate conditions. In proofs of total correctness, one resorts to the use of (countable) ordinals, and it is shown that all recursive ordinals are needed.