%J Electronic Notes in Theoretical Computer Science
%R 10.1016/j.entcs.2004.10.030
%X We introduce a simple graph logic that supports specification of Quality of Service (QoS) properties of applications. The idea is that we are not only interested in representing whether two sites are connected, but we want to express the QoS level of the connection. The evaluation of a formula in the graph logic is a value of a suitable algebraic structure, a c-semiring, representing the QoS level of the formula and not just a boolean value expressing whether or not the formula holds. We present some examples and briefly discuss the expressiveness and complexity of our logic.

%D 2006
%L eprints160
%K Graph Logics; QoS; Semirings; Distributed Systems
%A GianLuigi Ferrari
%A Alberto Lluch-Lafuente
%I Elsevier
%V 142
%O Proceedings of the First International Workshop on Views on Designing Complex Architectures (VODCA 2004)
%T A Logic for Graphs with QoS
%P 143-160