Refining internal choice in PEPA models
Stephen T. Gilmore, Jane Elizabeth Hillston · 1996
In a previous paper [GHH96] the authors presented a program development technique for stochastic process algebra models which was centred on the translation from a model into an abstract program skeleton which presents the structural and behavioural information from the model in programming language notation. The intention of this work, which we continue here, is to support the methodical development of concurrent programs from stochastic process algebra specifications of their behaviour and performance. 1 Introduction When deriving a concurrent program from a stochastic process algebra model significant care must be taken to achieve the correct treatment of choices in the model. Choices in a stochastic process algebra model represent abstract branching in the progress of the system; this branching is resolved by race conditions which determine the branch to be taken. Choices in the corresponding programming language representation are branching statements such as case statements or, ...