A process calculus for qos-aware applications

Authors:
Rocco De Nicola;Gianluigi Ferrari;Ugo Montanari;Rosario Pugliese;Emilio Tuosto
Affiliations:
Dipartimento di Sistemi e Informatica, Università di Firenze, Firenze, Italy;Dipartimento di Informatica, Pisa, Italy;Dipartimento di Informatica, Pisa, Italy;Dipartimento di Sistemi e Informatica, Università di Firenze, Firenze, Italy;Dipartimento di Informatica, Pisa, Italy
Venue:
COORDINATION'05 Proceedings of the 7th international conference on Coordination Models and Languages
Year:
2005

Citing 12
Cited 21

Semiring-based constraint satisfaction and optimization

Journal of the ACM (JACM)
KLAIM: A Kernel Language for Agents Interaction and Mobility

IEEE Transactions on Software Engineering
A calculus for cryptographic protocols

Information and Computation
Service Combinators for Web Computing

IEEE Transactions on Software Engineering
Types for access control

Theoretical Computer Science
Semiring frameworks and algorithms for shortest-distance problems

Journal of Automata, Languages and Combinatorics
Programming Access Control: The KLAIM Experience

CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Type Systems for Concurrent Processes: From Deadlock-Freedom to Livelock-Freedom, Time-Boundedness

TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Introduction: Service-oriented computing

Communications of the ACM - Service-oriented computing
Contracts and types

Communications of the ACM - Service-oriented computing
A generic type system for the Pi-calculus

Theoretical Computer Science
Trust evaluation in ad-hoc networks

Proceedings of the 3rd ACM workshop on Wireless security

A Synchronous Process Calculus for Service Costs

SEFM '05 Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods
Global computing in a dynamic network of tuple spaces

Science of Computer Programming
Policy-based Coordination in PAGODA: A Case Study

Electronic Notes in Theoretical Computer Science (ENTCS)
Q-Automata: Modelling the Resource Usage of Concurrent Components

Electronic Notes in Theoretical Computer Science (ENTCS)
Basic observables for a calculus for global computing

Information and Computation
Service Discovery and Negotiation With COWS

Electronic Notes in Theoretical Computer Science (ENTCS)
Coordination Via Types in an Event-Based Framework

FORTE '07 Proceedings of the 27th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
On the Challenge of Engineering Socio-technical Systems

Software-Intensive Systems and New Computing Paradigms
A Nonmonotonic Soft Concurrent Constraint Language for SLA Negotiation

Electronic Notes in Theoretical Computer Science (ENTCS)
Which Soft Constraints do you Prefer?

Electronic Notes in Theoretical Computer Science (ENTCS)
Coordinating Asynchronous and Open Distributed Systems under Semiring-Based Timing Constraints

Electronic Notes in Theoretical Computer Science (ENTCS)
From Coordination to Stochastic Models of QoS

COORDINATION '09 Proceedings of the 11th International Conference on Coordination Models and Languages
QoS-Driven Service Selection and Composition Using Quantitative Constraint Automata

Fundamenta Informaticae - Application of Concurrency to System Design
CC-Pi: a constraint-based language for specifying service level agreements

ESOP'07 Proceedings of the 16th European conference on Programming
Component connectors with QoS guarantees

COORDINATION'07 Proceedings of the 9th international conference on Coordination models and languages
A theory of design-by-contract for distributed multiparty interactions

CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Synchronised hyperedge replacement as a model for service oriented computing

FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
A Nonmonotonic Soft Concurrent Constraint Language to Model the Negotiation Process

Fundamenta Informaticae
QoS-Driven Service Selection and Composition Using Quantitative Constraint Automata

Fundamenta Informaticae - Application of Concurrency to System Design
On the reconfiguration of software connectors

Proceedings of the 28th Annual ACM Symposium on Applied Computing
QoS-aware management of monotonic service orchestrations

Formal Methods in System Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

The definition of suitable abstractions and models for identifying, understanding and managing Quality of Service (QoS) constraints is a challenging issue of the Service Oriented Computing paradigm. In this paper we introduce a process calculus where QoS attributes are first class objects. We identify a minimal set of primitives that allow capturing in an abstract way the ability to control and coordinate services in presence of QoS constraints.