Stochastic pi-calculus

被引:276
作者
Priami, C
机构
[1] Dipartimento di Informatica, Universitd di Pisa, Corso Italia, 40, Pisa
关键词
D O I
10.1093/comjnl/38.7.578
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
We extend the pi-calculus, a model of concurrent processes based on the notion of naming, to cope with performance modelling. The new language is called the stochastic pi-calculus (S pi). We obtain a more expressive language than classical stochastic process algebras because S pi allows one to describe dynamically reconfigurable or mobile networks. The semantics of S pi is given in the classical structural operational approach. In order to effectively compute performance measures, we define a stratified transition system that is finitely branching. We give a transition rule to directly yield a continuous time Markov chain from an S pi specification, with no transition system manipulation.
引用
收藏
页码:578 / 589
页数:12
相关论文
共 35 条
[1]  
ALLEN AO, 1978, PROBABILITY STATISTI
[2]  
BERNARDO M, 1994, UBLCS9410 U BOL LAB
[3]  
Boudol G., 1988, Fundamenta Informaticae, V11, P433
[4]  
BUCHHOLZ P, 1994, MARKOVIAN PROCESS AL
[5]  
CLEAVELAND R, 1994, P POPL 94, P326
[6]  
DEGANO P, 1992, LECT NOTES COMPUT SC, V623, P629
[7]  
DEGANO P, 1995, P ICALP 95 LNCS
[8]  
GIACALONE A, 1990, P ICALP 90 LNCS, V443, P765
[9]  
GILMORE S, 1994, P INT C MODELLING TE
[10]  
GOTZ N, 1992, 492 U ERL NURNB TECH