Network and processing overhead associated with web services is a significant challenge to its performance. As a result, web service providers often announce a service level agreement. This ensures that consumers, who pay for the service, can get the service at a given quality level. In this paper, we study the competition between two providers offering functionally the same web services, whe...

This paper describes a technique of expression decomposition which allows the use of rely/guarantee development rules that do not assume atomic expression evaluation. This decomposition provides a means of addressing the fact that the logical meaning of expressions relative to a single state and the semantic evaluation of expressions in a fine-grained concurrent language do not provide the same...

We present a compositional verification technique for systems that exhibit both probabilistic and nondeterministic behaviour. We adopt an assume-guarantee approach to verification, where both the assumptions made about system components and the guarantees that they provide are regular safety properties, represented by finite automata. Unlike previous proposals for assume-guarantee reasoning abo...

This thesis presents a framework for the automatic strategy synthesis fromquantitative specifications, in order to control autonomous systems. Wemodel systems as turn-based two-player zero-sum stochastic games, whichare able to express both stochastic and nondeterministic environmentaluncertainty. Given a system model and a specification, we define thestrategy synthesis prob...

Compositional verification techniques in the assumeguarantee style have been successfully applied to transition systems to efficiently reduce the search space by leveraging the compositional nature of the systems under consideration. We adapt these techniques to the domain of hybrid systems with affine dynamics. To build assumptions we introduce an abstraction based on location merging. We inte...

An important and still unsolved problem in gene prediction is designing an algorithm that not only predicts genes but estimates the quality of individual predictions as well. Since experimental biologists are interested mainly in the reliability of individual predictions (rather than in the average reliability of an algorithm) we attempted to develop a gene recognition algorithm that guarantees...

In this paper, we derive a statistical delay guarantee of the generalized Virtual Clock scheduling algorithm. We define the concept of an equivalent fluid and packet source and prove a theorem that relates the departure time of a packet in a fluid FCFS multiplexor to its departure time in a packet multiplexor that uses generalized Virtual Clock algorithm for scheduling packets. This theorem ena...