eprintid: 160
rev_number: 10
eprint_status: archive
userid: 30
dir: disk0/00/00/01/60
datestamp: 2011-03-09 14:42:08
lastmod: 2014-10-07 14:04:04
status_changed: 2011-03-09 14:42:08
type: article
metadata_visibility: show
item_issues_count: 0
creators_name: Ferrari, GianLuigi
creators_name: Lluch-Lafuente, Alberto
creators_id: 
creators_id: alberto.lluch@imtlucca.it
title: A Logic for Graphs with QoS
ispublished: pub
subjects: QA75
divisions: CSA
full_text_status: public
keywords: Graph Logics; QoS; Semirings; Distributed Systems
note: Proceedings of the First International Workshop on Views on Designing Complex Architectures (VODCA 2004)
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.

date: 2006-01
date_type: published
publication: Electronic Notes in Theoretical Computer Science
volume: 142
publisher: Elsevier
pagerange: 143-160
id_number: 10.1016/j.entcs.2004.10.030
refereed: TRUE
issn: 1571-0661
official_url: http://www.sciencedirect.com/science/article/B75H1-4HWXCFJ-C/2/aafa190eda879c65e6bd45b214205841
funders: This work has been supported by the European Research Training Network SEGRAVIS and the European FET project PROFUNDIS.
citation:   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)  
document_url: http://eprints.imtlucca.it/160/1/Ferrari_Lafuente_2006.pdf