Testing Equivalences of Time Petri Nets

Research output: Contribution to journalArticlepeer-review

Abstract

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.

Original languageEnglish
Pages (from-to)251-260
Number of pages10
JournalProgramming and Computer Software
Volume46
Issue number4
DOIs
Publication statusPublished - 1 Jul 2020

Fingerprint

Dive into the research topics of 'Testing Equivalences of Time Petri Nets'. Together they form a unique fingerprint.

Cite this