A Logic for Graphs with QoS

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. Key words: Graph Logics, QoS, Semirings, Distributed Systems.

• Type: Journal
• Year: 2006
• Where: ENTCS
• Authors: GianLuigi Ferrari, Alberto Lluch-Lafuente
• Keywords: ENTCS 2006, Graph Logics, QoS Level, Simple Graph Logic