STOCHASTIC WELL-FORMED COLORED NETS AND SYMMETRICAL MODELING APPLICATIONS

被引:179
作者
CHIOLA, G [1 ]
DUTHEILLET, C [1 ]
FRANCESCHINIS, G [1 ]
HADDAD, S [1 ]
机构
[1] UNIV PARIS 06,MASI LAB,F-75252 PARIS,FRANCE
关键词
BUS AND MEMORY CONTENTION; COMPUTATIONAL COMPLEXITY; HIGH-LEVEL PETRI NETS; LUMPABILITY CONDITION; MARKOV CHAINS; MODEL SYMMETRY; MULTIPROCESSOR SYSTEMS; PERFORMANCE EVALUATION; SYMBOLIC REACHABILITY GRAPH;
D O I
10.1109/12.247838
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The class of stochastic well-formed colored nets (SWN's) was defined as a syntactic restriction of stochastic high-level nets. The interest of the introduction of restrictions in the model definition is the possibility of exploiting the symbolic reachability graph (SRG) to reduce the complexity of Markovian performance evaluation with respect to classical Petri net techniques. It turns out that SWN's allow the representation of any color function in a structured form, so that any unconstrained high-level net can be transformed into a well-formed net. Moreover, most constructs useful for the modeling of distributed computer systems and architectures directly match the ''well-formed'' restriction, without any need of transformation. A nontrivial example of the usefulness of the technique in the performance modeling and evaluation of multiprocessor architectures is included.
引用
收藏
页码:1343 / 1360
页数:18
相关论文
共 26 条
[21]  
MARSAN MA, 1987, 1987 P SIGMETRICS C
[22]  
MARSAN MA, 1984, ACM T COMPUT SYST, V2
[23]  
MASAN MA, 1985, 2ND P INT C MOD TECH
[24]  
MOLLOY MK, 1982, IEEE T COMPUT, V31, P913, DOI 10.1109/TC.1982.1676110
[25]   PETRI NETS - PROPERTIES, ANALYSIS AND APPLICATIONS [J].
MURATA, T .
PROCEEDINGS OF THE IEEE, 1989, 77 (04) :541-580
[26]  
[No title captured]