Relevant Timed Schedules / Clock Valuations for Constructing Time Petri Net Reachability Graphs - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2008

Relevant Timed Schedules / Clock Valuations for Constructing Time Petri Net Reachability Graphs

Résumé

We consider here time Petri nets (the TPN model) and two of its state space abstractions: the state class graph (SCG) and the zone based graph (ZBG). We show that only some time points of the clock/firing domains of abstract states are relevant to construct a TPN reachability graph. Moreover, for the state class graph method, the graph computed using relevant time points is smaller than the SCG. Fulltext Preview For further information, please visit this web site.
Fichier non déposé

Dates et versions

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

Identifiants

  • HAL Id : hal-01125623 , version 1

Citer

Hanifa Boucheneb, Kamel Barkaoui. Relevant Timed Schedules / Clock Valuations for Constructing Time Petri Net Reachability Graphs. FORMATS'08, 6th International Conference on Formal Modeling and Analysis of Timed Systems, Saint-Malo, France, Jan 2008, X, France. pp.265-279. ⟨hal-01125623⟩

Collections

CNAM CEDRIC-CNAM
20 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More