On interleaving in {P,A}-Time Petri nets with strong semantics - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2010

On interleaving in {P,A}-Time Petri nets with strong semantics

Résumé

This paper deals with the reachability analysis of {P,A}-Time Petri nets ({P,A}-TPN in short) in the context of strong semantics. It investigates the convexity of the union of state classes reached by different interleavings of the same set of transitions. In BB08, the authors have considered the T-TPN model and its Contracted State Class Graph (CSCG) and shown that this union is not necessarily convex. They have however established some sufficient conditions which ensure convexity. This paper shows that for the CSCG of {P,A}-TPN, this union is convex and can be computed without computing intermediate state classes. These results allow to improve the forward reachability analysis by agglomerating, in the same state class, all state classes reached by different interleavings of the same set of transitions (abstraction by convex-union). For further information, please visit this web site.
Fichier non déposé

Dates et versions

hal-01125808 , version 1 (06-03-2015)

Identifiants

  • HAL Id : hal-01125808 , version 1

Citer

Hanifa Boucheneb, Kamel Barkaoui. On interleaving in {P,A}-Time Petri nets with strong semantics. INFINITY'10, 12th International Workshop on Verification of Infinite-State Systems, Singapore, 21st of September 2010, Jan 2010, X, France. pp.17-31. ⟨hal-01125808⟩
21 Consultations
0 Téléchargements

Partager

Gmail Mastodon Facebook X LinkedIn More