Stochastic pi-calculus with general distributions
Corrado Priami · 1996
In this study we extend stochastic ß-calculus allowing general probabilistic distributions to occur in its prefixes. We show that no additional information is needed in the labels of transitions or in the states of systems to derive an enabling relation between transitions. Enabling is then used to compute the residual life times of parallel activities that are not immediately selected when enabled. The policy according to which residual life times are computed is the enabling memory introduced for stochastic Petri nets and also implemented in TIPP through the mechanism of start references. 1 Introduction Many researchers advocate the need of integrating behavioural and performance analysis since the early stages of design of complex systems. This problem is even presented as a challenge for the future of computer science in [11]. The widespread dissemination of distributed systems and the paradigm of mobile computing makes the above integration essential. In fact, a design error whic...