A logic for graphs with QoS

Gianluigi Ferrari; Alberto Lluch Lafuente

doi:10.1016/j.entcs.2004.10.030

A logic for graphs with QoS

Gianluigi Ferrari, Alberto Lluch Lafuente

Università di Pisa

Research output: Contribution to journal › Conference article › Research › peer-review

Abstract

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. © 2005 Elsevier B.V. All rights reserved.

Original language	English
Journal	Electronic Notes in Theoretical Computer Science
Volume	142
Issue number	SPEC. ISS.
Pages (from-to)	143-160
Number of pages	18
ISSN	1571-0661
DOIs	https://doi.org/10.1016/j.entcs.2004.10.030
Publication status	Published - 2006
Externally published	Yes
Event	1st International Workshop on Views on Designing Complex Architectures - Bertinoro , Italy Duration: 11 Sept 2004 → 12 Sept 2004 Conference number: 1

Conference

Conference	1st International Workshop on Views on Designing Complex Architectures
Number	1
Country/Territory	Italy
City	Bertinoro
Period	11/09/2004 → 12/09/2004

Keywords

Boolean algebra
Computational complexity
Distributed computer systems
Formal logic
Graph theory
Quality of service
Distributed Systems
Graph Logics
Semirings
QoS
T

Access to Document

10.1016/j.entcs.2004.10.030

OpenUrl availability

Full text

Cite this

@inproceedings{0149cf46e2404ca5b364ddac3dd07087,

title = "A logic for graphs with QoS",

abstract = "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. {\textcopyright} 2005 Elsevier B.V. All rights reserved.",

keywords = "Boolean algebra, Computational complexity, Distributed computer systems, Formal logic, Graph theory, Quality of service, Distributed Systems, Graph Logics, Semirings, QoS, T",

author = "Gianluigi Ferrari and {Lluch Lafuente}, Alberto",

year = "2006",

doi = "10.1016/j.entcs.2004.10.030",

language = "English",

volume = "142",

pages = "143--160",

journal = "Electronic Notes in Theoretical Computer Science",

issn = "1571-0661",

publisher = "Elsevier",

number = "SPEC. ISS.",

note = "1st International Workshop on Views on Designing Complex Architectures , VODCA'04 ; Conference date: 11-09-2004 Through 12-09-2004",

}

TY - GEN

T1 - A logic for graphs with QoS

AU - Ferrari, Gianluigi

AU - Lluch Lafuente, Alberto

N1 - Conference code: 1

PY - 2006

Y1 - 2006

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. © 2005 Elsevier B.V. All rights reserved.

AB - 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. © 2005 Elsevier B.V. All rights reserved.

KW - Boolean algebra

KW - Computational complexity

KW - Distributed computer systems

KW - Formal logic

KW - Graph theory

KW - Quality of service

KW - Distributed Systems

KW - Graph Logics

KW - Semirings

KW - QoS

KW - T

U2 - 10.1016/j.entcs.2004.10.030

DO - 10.1016/j.entcs.2004.10.030

M3 - Conference article

SN - 1571-0661

VL - 142

SP - 143

EP - 160

JO - Electronic Notes in Theoretical Computer Science

JF - Electronic Notes in Theoretical Computer Science

IS - SPEC. ISS.

T2 - 1st International Workshop on Views on Designing Complex Architectures

Y2 - 11 September 2004 through 12 September 2004

ER -

A logic for graphs with QoS

Abstract

Conference

Keywords

Access to Document

OpenUrl availability

Fingerprint

Cite this