Ferrari, GianLuigi and Lluch-Lafuente, Alberto A Logic for Graphs with QoS. Electronic Notes in Theoretical Computer Science, 142. pp. 143-160. ISSN 1571-0661 (2006)
- Published Version
Available under License Creative Commons Attribution No Derivatives.
Download (262kB) | Preview
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.
|Additional Information:||Proceedings of the First International Workshop on Views on Designing Complex Architectures (VODCA 2004)|
|Funders:||This work has been supported by the European Research Training Network SEGRAVIS and the European FET project PROFUNDIS.|
|Uncontrolled Keywords:||Graph Logics; QoS; Semirings; Distributed Systems|
|Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|Research Area:||Computer Science and Applications|
|Depositing User:||Users 30 not found.|
|Date Deposited:||09 Mar 2011 14:42|
|Last Modified:||07 Oct 2014 14:04|
Actions (login required)