Strong behavioral similarities in timed-arc Petri nets

The concept of process similarity has attracted the attention of many researchers in the recent literature, since it measures the degree of proximity of processes. Similarities are therefore useful for the efficient management of large repositories, since they allow us to find the appropriate proces...

Full description

Saved in:
Bibliographic Details
Published inApplied mathematics and computation Vol. 333; pp. 401 - 415
Main Author Valero, Valentín
Format Journal Article
LanguageEnglish
Published Elsevier Inc 15.09.2018
Subjects
Formal methods
Reachability graphs
Similarities
Timed-arc Petri nets
Formal methods
Reachability graphs
Timed-arc Petri nets
Similarities
Online AccessGet full text

Cover

More Information
Summary:The concept of process similarity has attracted the attention of many researchers in the recent literature, since it measures the degree of proximity of processes. Similarities are therefore useful for the efficient management of large repositories, since they allow us to find the appropriate process models among hundreds or thousands of possible candidates. However, time constraints are usually omitted when these similarity measures are defined, so in this paper two similarity measures are defined over a timed extension of Petri nets, the so-called timed-arc Petri nets, in which tokens are assigned an age indicating the time elapsed from creation, and PT-arcs (place to transition arcs) are labeled with time intervals that are used to restrict the age of the tokens that can be used to fire the adjacent transition.
ISSN:0096-3003
1873-5649
DOI:10.1016/j.amc.2018.03.073