Verification of Hypertorus Communication Grids by Infinite Petri Nets and Process Algebra

作     者：Dmitry A.Zaitsev Tatiana R.Shmeleva Jan Friso Groote 

作者机构：IEEE the Vistula University the A.S. Popov Odessa National Academy of Telecommunications the Eindhoven University of Technology 

出 版 物：《IEEE/CAA Journal of Automatica Sinica》 (自动化学报（英文版）)

年 卷 期：2019年第6卷第3期

页      面：733-742页

核心收录：

学科分类：0810[工学-信息与通信工程] 1205[管理学-图书情报与档案管理] 12[管理学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 08[工学] 0802[工学-机械工程] 0811[工学-控制科学与工程] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：supported in part by NATO(ICS.NUKR.CLG982689) 

主　　题：Computing grid conservativeness deadlock hypertorus infinite Petri nets process algebra systems biology 

摘      要：A model of a hypertorus communication grid has been constructed in the form of an infinite Petri net. A grid cell represents either a packet switching device or a bioplast cell. A parametric expression is obtained to allow a finite specification of an infinite Petri net. To prove properties of an ideal communication protocol, we derive an infinite Diophantine system of equations from it, which is subsequently solved. Then we present the programs htgen and ht-mcrl2-gen, developed in the C language, which generate Petri net and process algebra models of a hypertorus with a given number of dimensions and grid size. These are the inputs for the respective modeling tools Tina and mCRL2, which provide model visualization, step simulation, state space generation and reduction, and structural analysis techniques. Benchmarks to compare the two approaches are obtained. An ad-hoc induction-like technique on invariants,obtained for a series of generated models, allows the calculation of a solution of the Diophantine system in a parametric *** is proven that the basic solutions of the infinite system have been found and that the infinite Petri net is bounded and conservative. Some remarks regarding liveness and liveness enforcing techniques are also presented.