Itegrating Behavioural and Performance Analysis with Topology Information

We consider ß-calculus, amodel of concurrent processes based on the notion of naming, extended with probabilistic information. The new language is an evolution of CSP - like stochastic process algebra that we call stochastic ß- calculus. Furthermore, we integrate the semantic description of the language with topology information expressed through axioms. The new formalism is suitable to study behavioural and performance property of distributed systems. In particular, we can compare different allocations of systems on a fixed network architecture with respect to expected performance. 1 Introduction The design and development of concurrent distributed systems is a difficult task due to the large number of parameters that designers must take into account. Hence, the use of formal methods during all the life-cycle of these systems is becoming well-accepted. Particular interest is devoted to process algebras such as CCS [15], CSP [13], Meije [2]. Only few operators (sequential and parall..