Modeling of the Grid system node behavior based on Petri nets

被引:0
作者
Shelestov, A. Yu. [1 ,2 ]
机构
[1] Natl Acad Sci Ukraine, Inst Space Res, Kiev, Ukraine
[2] Natl Space Agcy Ukraine, Kiev, Ukraine
关键词
Grid system; Petri net; incidence matrix; TSS-algorithm; bounded network; mutex; fairness; deadlock free;
D O I
10.1615/JAutomatInfScien.v40.i2.40
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
A computational node of the Grid system was investigated via Petri net approach. The model of node operation was constructed and its structural properties were investigated. In particular, it was shown that the network constructed was bounded, alive and did not have inaccessible places. For the network constructed was performed the feasibility analysis of mutex and fairness properties.
引用
收藏
页码:41 / 51
页数:11
相关论文
共 9 条
[1]  
DUBININ VN, 1997, LANGUAGES LOGICAL PR
[2]  
Krauter K., 2001, SOFTWARE PRACTICE EX, P1
[3]  
Krivoi S, 2002, LECT NOTES COMPUT SC, V2328, P264
[4]  
KRIVOI SL, 1999, DOKL NAN UKRAINY, P107
[5]  
KUSSUL NN, 2004, KIBERNETIKA VYCHISLI, P3
[6]  
LETICHEVSKIY AA, CURRENT PROBLEMS CYB
[7]  
MENASKE D, 2003, WEB SERVICE PRODUCTI
[8]   ON CONTEXT-FREE LANGUAGES [J].
PARIKH, RJ .
JOURNAL OF THE ACM, 1966, 13 (04) :570-+
[9]  
Peterson J. L., 1984, PETRI NET THEORY MOD