Affiliations: [a] IBISC, University of Evry, Université Paris-Saclay, 91025, Evry, France. hanna.klaudel@ibisc.univ-evry.fr | [b] School of Computing, Newcastle University, Newcastle upon Tyne, NE4 5TG, United Kingdom. maciej.koutny@ncl.ac.uk | [c] ICTT and ISN Laboratory, Xidian University, Xi’an, 710071, P.R. China. zhhduan@mail.xidian.edu.cn | [d] School of Computing, Newcastle University, Newcastle upon Tyne, NE4 5TG, United Kingdom. benmos63@gmail.com
Correspondence:
[*]
Address for correspondence: IBISC, University of Evry, Université Paris-Saclay, 91025, Evry, France.
Abstract: In this paper, we further develop a recently introduced semantic link between temporal logics and Petri nets. We focus on two specific formalisms, Interval Temporal Logic (ITL) and Box Algebra (BA), which are closely related by their compositional approach to constructing system descriptions. The overall goal of our investigation is to translate Petri nets into behaviourally equivalent logical formulas. As a result, the analysis of system properties can be carried out using either of the two formalisms, exploiting their respective strengths and powerful tool support. The contribution of this paper is twofold. First, we extend the existing translation from BA to ITL, by removing restrictions concerning the way control flow of concurrent system is modelled, and by allowing a fully general synchronisation operator. Second, we strengthen the notion of equivalence between a Petri net and the corresponding logical formula by proving such an equivalence at the level of transition-based executions of Petri nets rather than just by looking at their labels. We also show that the complexity of the proposed translation compares favourably with the complexity of the translation from BA expressions to Petri nets.
Keywords: Interval Temporal Logic, Petri nets, box algebra, composition, semantics, general synchronisation, step sequence, equivalence
