We present algorithms for testing the satisfiability and finding the tightened transitive closure of conjunctions of addition constraints of the form ±x ± y ≤ d and bound co...
Abstract. Most of the decision procedures for symbolic analysis of protocols are limited to a fixed set of algebraic operators associated with a fixed intruder theory. Examples o...
A fundamental issue in the engineering of coordination models is n coordination abstractions that are correct with respect to the specification of the coordination model they imp...
Abstract. We describe a general component software framework designed for demanding grid environments that provides optimal performance for the assembled component application. Thi...
Nathalie Furmento, Anthony Mayer, Stephen McGough,...
This paper investigates the use of a complete metric space framework for providing denotational semantics to a real-time process algebra. The study is carried out in a non-interlea...
Christel Baier, Joost-Pieter Katoen, Diego Latella