AUTOMATING THE CONVERSION OF COLORED PETRI NETS WITH QUALITATIVE TOKENS INTO COLORED PETRI NETS WITH QUANTITATIVE TOKENS

被引:0
|
作者
Hlomozda, D. K. [1 ]
Glybovets, M. M. [1 ]
Maksymets, O. M. [2 ]
机构
[1] Natl Univ Kyiv Mohyla Acad, Kiev, Ukraine
[2] Facebook, Los Altos, CA USA
关键词
colored Petri nets; Diophantine equations; finite-state machines; grid structure;
D O I
10.1007/s10559-018-0066-4
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The authors describe an algorithm for conversion of colored Petri nets with qualitative tokens into a colored Petri net with quantitative tokens preserving boundedness, mutual exclusion, and liveness properties. This conversion allows the invariance method to be applied to colored Petri nets, which uses the Truncated Set of Solutions finding algorithm for Petri net state equations expressed through systems of linear homogenous Diophantine equations. To show the algorithm's efficiency, it is applied to the colored Petri net that models the operation of a grid system. Equivalence of net models is tested by constructing and analyzing equal finite-state machine.
引用
收藏
页码:650 / 661
页数:12
相关论文
共 50 条