Strong behavioral similarities in timed-arc Petri nets

Valentín Valero

Applied Mathematics and Computation, 2018, vol. 333, issue C, 401-415

Abstract: 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.

Keywords: Formal methods; Timed-arc Petri nets; Reachability graphs; Similarities (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300318302546
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:333:y:2018:i:c:p:401-415

DOI: 10.1016/j.amc.2018.03.073

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().