TY  - JOUR
N2  - 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.

N1  - Proceedings of the First International Workshop on Views on Designing Complex Architectures (VODCA 2004)
VL  - 142
TI  - A Logic for Graphs with QoS
A1  - Ferrari, GianLuigi
A1  - Lluch-Lafuente, Alberto
AV  - public
SP  - 143
EP  - 160
Y1  - 2006/01//
SN  - 1571-0661
KW  - Graph Logics; QoS; Semirings; Distributed Systems
PB  - Elsevier
UR  - http://www.sciencedirect.com/science/article/B75H1-4HWXCFJ-C/2/aafa190eda879c65e6bd45b214205841
ID  - eprints160
JF  - Electronic Notes in Theoretical Computer Science
ER  -