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.

中文翻译：

---

测试时间Petri网的等价性

摘要

在本文中，我们研究了在安全时间Petri网（过渡以时间间隔标记的基本网系统，只有其较低的时间可以触发）的情况下，在交织，部分顺序语义和组合语义上测试等价性的族。达到了上限，并且在达到上限时被迫触发）。为此，开发了以下三种安全时间Petri网行为的表示：网络过渡触发序列，表示交织语义；时间因果过程，从中得出部分订单；以及时间因果树，其节点是过渡触发和弧的序列，由有关部分顺序的信息标记。