Counting Petri net markings from reduction equations - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue International Journal on Software Tools for Technology Transfer Année : 2020

Counting Petri net markings from reduction equations

Résumé

We propose a method to count the number of reachable markings of a Petri net without having to enumerate these first. The method relies on a structural reduction system that reduces the number of places and transitions of the net in such a way that we can faithfully compute the number of reachable markings of the original net from the reduced net and the reduction history. The method has been implemented and computing experiments show that reductions are effective on a large benchmark of models.
Fichier principal
Vignette du fichier
sttt.pdf (637.46 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02125337 , version 1 (10-05-2019)

Identifiants

Citer

Bernard Berthomieu, Didier Le Botlan, Silvano Dal Zilio. Counting Petri net markings from reduction equations. International Journal on Software Tools for Technology Transfer, 2020, 22, pp.163-181. ⟨10.1007/s10009-019-00519-1⟩. ⟨hal-02125337⟩
117 Consultations
772 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More