Verification of communication hexagonal grid with the infinite petri nets

被引:0
|
作者
Shmeleva, T.R. [1 ]
机构
[1] O.S. Popov Odessa National Academy of Communication, 1 Koval's'ka St, Odessa,65000, Ukraine
关键词
Petri nets;
D O I
10.1615/telecomradeng.v78.i2.40
中图分类号
O144 [集合论]; O157 [组合数学(组合学)];
学科分类号
070104 ;
摘要
A formal direct parametric description of the hexagonal grid model with side k is constructed according to the specified grid composition rules. A system of linear equations is constructed for finding invariants of positions on the basis of a direct description of the model. A method for calculating linear invariants of infinite Petri nets with a regular structure for an open hexagonal grid is used, and a solution of a system of linear equations in parametric form is obtained. It is proved that the hexagonal grid model, represented in the form of infinite Petri net, is a p-invariant Petri net for an arbitrary natural number k and has the boundedness and conservativeness properties. Communication grids, representing the implementation of the studied model, can be constructed using devices with limited capacity without overflow. ©2019 by Begell House, Inc.
引用
收藏
页码:125 / 135
相关论文
共 50 条
  • [31] The Complexity of Diagnosability and Opacity Verification for Petri Nets
    Berard, Beatrice
    Haar, Stefan
    Schmitz, Sylvain
    Schwoon, Stefan
    [J]. FUNDAMENTA INFORMATICAE, 2018, 161 (04) : 317 - 349
  • [32] Slicing Petri nets with an application to workflow verification
    Rakow, Astrid
    [J]. SOFSEM 2008: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2008, 4910 : 436 - 447
  • [33] Marking diagnosability verification in labeled Petri nets
    Ma, Ziyue
    Yin, Xiang
    Li, Zhiwu
    [J]. AUTOMATICA, 2021, 131
  • [34] Verification of siphons and traps for algebraic Petri nets
    Schmidt, K
    [J]. APPLICATION AND THEORY OF PETRI NETS 1997, 1997, 1248 : 427 - 446
  • [35] Testable design verification using Petri nets
    Ruzicka, R
    [J]. EUROMICRO SYMPOSIUM ON DIGITAL SYSTEM DESIGN, PROCEEDINGS, 2003, : 304 - 311
  • [36] Verification of Timed-Arc Petri Nets
    Jacobsen, Lasse
    Jacobsen, Morten
    Moller, Mikael H.
    Srba, Jiri
    [J]. SOFSEM 2011: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2011, 6543 : 46 - 72
  • [37] COMMUNICATION PROTOCOL VALIDATION BY PETRI NETS
    BANDMAN, OL
    [J]. AVTOMATIKA I VYCHISLITELNAYA TEKHNIKA, 1986, (06): : 82 - 91
  • [38] Verification of Estelle-specified communication protocols using high-level Petri nets
    Nepomniaschy, VA
    Alekseev, GI
    Bystrov, AV
    Myl'nikov, SP
    Okunishnikova, EV
    Chubarev, PA
    Churina, TG
    [J]. PROGRAMMING AND COMPUTER SOFTWARE, 2001, 27 (02) : 58 - 68
  • [39] Verification of Estelle-Specified Communication Protocols Using High-Level Petri Nets
    V. A. Nepomniaschy
    G. I. Alekseev
    A. V. Bystrov
    S. P. Myl'nikov
    E. V. Okunishnikova
    P. A. Chubarev
    T. G. Churina
    [J]. Programming and Computer Software, 2001, 27 : 58 - 68
  • [40] Observability of continuous Petri nets with infinite server semantics
    Mahulea, Cristian
    Recalde, Laura
    Silva, Manuel
    [J]. NONLINEAR ANALYSIS-HYBRID SYSTEMS, 2010, 4 (02) : 219 - 232