Abstraction in probabilistic process algebras

Chris Tofts

(University of Manchester)

There has been an increasing interest over the last few years in the use of formal approaches in performance modelling and simulation. In particular probabilistic process algebra permits a natural description of interacting systems. In this talk we address some issues in the efficient calculation of performance parameters derived from the formal description of these systems. We shall concentrate on abstraction techniques that permit us to address large scale problems and have reliable approximation properties.
Tuesday 12th March 1996, 14:30
Seminar Room 322
Department of Computer Science