Petri Net Discovery of Discrete Event Processes by Computing T-invariants - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2014

Petri Net Discovery of Discrete Event Processes by Computing T-invariants

Résumé

In this paper the problem of discovering a Petri net (PN) from sampled events sequences representing the execution of industrial or business processes is addressed. A method for building a 1-bounded PN from a single event sequence S composed of numerous execution traces is presented; it is based on determining causal and concurrency relations between tasks. A technique for computing the t-invariants of the PN from S is proposed; the obtained invariants allow determining the structure of a PN that executes S. The algorithms derived from the method have been implemented and tested on numerous examples of diverse complexity.
Fichier principal
Vignette du fichier
2014_ETFA_Tonatiuh.pdf (1.01 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01067790 , version 1 (24-09-2014)

Identifiants

  • HAL Id : hal-01067790 , version 1

Citer

Tonatiuh Tapia-Flores, Ernesto López-Mellado, Ana-Paula Estrada-Vargas, Jean-Jacques Lesage. Petri Net Discovery of Discrete Event Processes by Computing T-invariants. 19th IEEE Int. Conf. on Emerging Technologies and Factory Automation (ETFA'14), Sep 2014, Barcelone, Spain. paper 345, 8 p. ⟨hal-01067790⟩
121 Consultations
207 Téléchargements

Partager

Gmail Facebook X LinkedIn More