State Space Computation and Analysis of Time Petri Nets - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Theory and Practice of Logic Programming Année : 2006

State Space Computation and Analysis of Time Petri Nets

Résumé

We present in this paper a forward zone-based algorithm to compute the state space of a bounded Time Petri Net: the method is different and more efficient than the classical State Class Graph. We prove the algorithm to be exact with respect to the reachability problem. Furthermore, we propose a translation of the computed state space into a Timed Automaton, proved to be timed bisimilar to the original Time Petri Net.

Domaines

Autre [cs.OH]
Fichier principal
Vignette du fichier
grr-tplp-2006.pdf (265.33 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00489232 , version 1 (04-06-2010)

Identifiants

  • HAL Id : hal-00489232 , version 1

Citer

Guillaume Gardey, Olivier Henri Roux, Olivier Roux. State Space Computation and Analysis of Time Petri Nets. Theory and Practice of Logic Programming, 2006, 6 (3), pp.301--320. ⟨hal-00489232⟩
197 Consultations
842 Téléchargements

Partager

Gmail Facebook X LinkedIn More