Michele Loreti

Learn More
Service-oriented computing is calling for novel computational models and languages with primitives for client-server interaction, orchestration and unexpected events handling. We present CaSPiS, a process calculus where the notions of session and pipelining play a central role. Sessions are two-sided and can be equipped with protocols executed by each side.(More)
We seek for a small set of primitives that might serve as a basis for formalising and programming service oriented applications over global computers. As an outcome of this study we introduce here SCC, a process calculus that features explicit notions of service definition, service invocation and session handling. Our proposal has been influenced by Orc, a(More)
Klaim (Kernel Language for Agents Interaction and Mobility) is an experimental language specifically designed to program distributed systems consisting of several mobile components that interact through multiple distributed tuple spaces. Klaim primitives allow programmers to distribute and retrieve data and processes to and from the nodes of a net.(More)
SCEL is a new language specifically designed to model autonomic components and their interaction. It brings together various programming abstractions that permit to directly represent knowledge, behaviors and aggregations according to specific policies. It also supports naturally programming self-awareness, context-awareness, and adaptation. In this paper,(More)
A variant of Rate Transition Systems (RTS), proposed by Klin and Sassone, is introduced and used as the basic model for defining stochastic behaviour of processes. The transition relation used in our variant associates to each process, for each action, the set of possible futures paired with a measure indicating their rates. We show how RTS can be used for(More)
A novel, scalable, on-the-fly model-checking procedure is presented to verify bounded PCTL properties of selected individuals in the context of very large systems of independent interacting objects. The proposed procedure combines on-the-fly model checking techniques with deterministic mean-field approximation in discrete time. The asymptotic correctness of(More)
Predicate-based communication allows components of a system to send messages and requests to ensembles of components that are determined at execution time through the evaluation of a predicate, in a multicast fashion. Predicate-based communication can greatly simplify the programming of autonomous and adaptive systems. We present a stochastically timed(More)
We present measurements of the forward-backward charge asymmetry in top pair production using 1.9 fb;{-1} of pp[over ] collisions at sqrt[s]=1.96 TeV recorded with the Collider Detector at Fermilab II. Correcting for acceptance and measurement dilutions we obtain parton-level asymmetries of A_{FB};{pp[over ]}=0.17+/-0.08 in the pp[over ] frame and(More)
We present a measurement of the W-boson mass using 200 pb{-1} of data collected in pp[over ] collisions at sqrt[s]=1.96 TeV by the CDF II detector at run II of the Fermilab Tevatron. With a sample of 63 964 W-->enu candidates and 51 128 W-->munu candidates, we measure M_{W}=80 413+/-34{stat}+/-34{syst}=80,413+/-48 MeV/c;{2}. This is the most precise single(More)