State Space Computation and Analysis of Time Petri Nets

Guillaume Gardey 1 Olivier Henri Roux 1 Olivier Roux 2
2 MeForBio
IRCCyN - Institut de Recherche en Communications et en Cybernétique de Nantes
Abstract : 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.
Document type :
Journal articles
Liste complète des métadonnées

Cited literature [29 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00489232
Contributor : Olivier Henri Roux <>
Submitted on : Friday, June 4, 2010 - 11:43:09 AM
Last modification on : Wednesday, December 19, 2018 - 3:02:08 PM
Document(s) archivé(s) le : Friday, September 17, 2010 - 1:07:12 PM

File

grr-tplp-2006.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00489232, version 1

Citation

Guillaume Gardey, Olivier Henri Roux, Olivier Roux. State Space Computation and Analysis of Time Petri Nets. Theory and Practice of Logic Programming, Cambridge University Press (CUP), 2006, 6 (3), pp.301--320. ⟨hal-00489232⟩

Share

Metrics

Record views

342

Files downloads

572