Delay-Dependent Partial Order Reduction Technique for Time Petri Nets - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2014

Delay-Dependent Partial Order Reduction Technique for Time Petri Nets

Résumé

Partial order reduction techniques aim at coping with the state explosion problem by reducing, while preserving the properties of interest, the number of transitions to be fired from each state of the model. For (time) Petri nets, the selection of these transitions is, generally, based on the structure of the (underlying) Petri net and its current marking. This paper proposes a partial order reduction technique for time Petri nets (TPN in short), where the selection procedure takes into account the structure, including the firing intervals, and the current state (i.e., the current marking and the firing delays of the enabled transitions). We show that our technique preserves non-equivalent firing sequences of the TPN. Therefore, its extension to deal with LTL ??X properties is straightforward, using the well established methods based on the stuttering equivalent sequences.
Fichier non déposé

Dates et versions

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

Identifiants

  • HAL Id : hal-01126438 , version 1

Citer

Hanifa Boucheneb, Kamel Barkaoui. Delay-Dependent Partial Order Reduction Technique for Time Petri Nets. 12th International Conference, FORMATS 2014 - Lecture Notes in Computer Science, Sep 2014, X, France. pp.53-68. ⟨hal-01126438⟩
57 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More