Trust transfer is a common technique employed in trust management systems to establish relationships between parties that are strangers. It is also well known that trust is not always transferable. That is, given an existing trust relationship, it may or may not be possible to derive new trust from it. In particular, it is not known under which constraints trust is transferable. In this paper w...

in treating the subject of musical language, a persian musician would be intrinsically drawn to the structural similarities between the persian music and language. indeed persian music and language are extremely related in their metrics, intonations and structural phrases (syntax). although we will draw upon this relationship, our aim in this article is to present “music as a language,” consist...

Discrete notions of behavioural equivalence sit uneasily with semantic models featuring quantitative data, like probabilistic transition systems. In this paper we present a pseudometric on a class of probabilistic transition systems yielding a quantitative notion of behavioural equivalence. The pseudometric is defined via the terminal coalgebra of a functor based on a metric on the space of Bor...

We propose a framework for comparing the expressive power and computational behaviour of modal logics designed for reasoning about qualitative aspects of metric spaces. Within this framework we can compare such well-known logics as S4 (for the topology induced by the metric), wK4 (for the derivation operator of the topology), variants of conditional logic, as well as logics of comparative simil...

Modal analysis is extensively used to study dynamic behavior of continuous and lumped parameter linear systems. More specifically, modal analysis can be used for the analysis and controller design of dynamic systems. In both cases, reduction of model size without degrading the accuracy is often required for the efficient use of the model. The reduction of modal models has been extensively studi...

In [8, 6] we introduced a family of ‘modal’ languages intended for talking about distances. These languages are interpreted in ‘distance spaces’ which satisfy some (or all) of the standard axioms of metric spaces. Among other things, we singled out decidable logics of distance spaces and proved expressive completeness results relating classical and modal languages. The aim of this paper is to a...