Unfolding of time Petri nets for quantitative time analysis - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2009

Unfolding of time Petri nets for quantitative time analysis

Résumé

The verification of properties on a Time Petri net is often based on the state class graph. For a highly concurrent system, the construction of a state graph often faces to the problem of combinatory explosion. This problem is due to the systematic interleaving of concurrent transitions. This paper proposes a new method of unfolding limiting as much as possible interleavings. This unfolding keeps a partial order execution and interleaving are hold on when their allow to put all conflicts in a total order. The method gives a way to generate a complete finite prefix unfolding based on the construction of the exhaustive set of scenarios on a safe time Petri net. Moreover, the method allows various quantitative time analyses based on the complete finite prefix unfolding and on a permanent time database.
Fichier principal
Vignette du fichier
tisto09.pdf (321.12 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00631054 , version 1 (11-10-2011)

Identifiants

  • HAL Id : hal-00631054 , version 1

Citer

David Delfieu, Medesu Sogbohossou. Unfolding of time Petri nets for quantitative time analysis. International Workshop pn Timing and Stochasticity in Petri nets and pther models of concurrency, Jun 2009, Paris, France. pp.31-45. ⟨hal-00631054⟩
142 Consultations
178 Téléchargements

Partager

Gmail Facebook X LinkedIn More