Результаты исследований: Научные публикации в периодических изданиях › статья › Рецензирование
Testing Equivalences of Time Petri Nets. / Bozhenkova, E. N.; Virbitskaite, I. B.
в: Programming and Computer Software, Том 46, № 4, 01.07.2020, стр. 251-260.Результаты исследований: Научные публикации в периодических изданиях › статья › Рецензирование
}
TY - JOUR
T1 - Testing Equivalences of Time Petri Nets
AU - Bozhenkova, E. N.
AU - Virbitskaite, I. B.
PY - 2020/7/1
Y1 - 2020/7/1
N2 - In the paper, we study a family of testing equivalences in interleaving, partial-order semantics, and combined semantics in the context of safe time Petri nets (elementary net systems whose transitions are labeled with time firing intervals, can fire only if their lower time bounds are attained, and are forced to fire when their upper time bounds are reached). For this purpose, the following three representations of behavior of safe time Petri nets are developed: sequences of firings of net transitions, which represent interleaving semantics; time causal processes, from which partial orders are derived; and time causal tree, whose nodes are sequences of transition firings and arcs are labeled by information about partial orders. We establish relationships between these equivalences and show that semantics of time causal processes and time causal trees coincide.
AB - In the paper, we study a family of testing equivalences in interleaving, partial-order semantics, and combined semantics in the context of safe time Petri nets (elementary net systems whose transitions are labeled with time firing intervals, can fire only if their lower time bounds are attained, and are forced to fire when their upper time bounds are reached). For this purpose, the following three representations of behavior of safe time Petri nets are developed: sequences of firings of net transitions, which represent interleaving semantics; time causal processes, from which partial orders are derived; and time causal tree, whose nodes are sequences of transition firings and arcs are labeled by information about partial orders. We establish relationships between these equivalences and show that semantics of time causal processes and time causal trees coincide.
UR - http://www.scopus.com/inward/record.url?scp=85089171817&partnerID=8YFLogxK
U2 - 10.1134/S0361768820040040
DO - 10.1134/S0361768820040040
M3 - Article
AN - SCOPUS:85089171817
VL - 46
SP - 251
EP - 260
JO - Programming and Computer Software
JF - Programming and Computer Software
SN - 0361-7688
IS - 4
ER -
ID: 24955912