State class Timed Automaton of a Time Petri Net - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2003

State class Timed Automaton of a Time Petri Net

Résumé

In this paper, we propose a method for building the state class graph of a bounded time Petri net (TPN) as a timed automaton (TA). We consider bounded TPN, whose underlying net is not necessarily bounded. We prove that the obtained TA is timed-bisimilar to the initial TPN. The number of clocks of the automaton is much lower than with other methods available. It allows us to check real-time properties on bounded TPN with efficient TA model-checkers. We have implemented the method, and give some experimental results in this paper, illustrating the efficiency of the algorithm in terms of clock number.

Domaines

Autre [cs.OH]
Fichier non déposé

Dates et versions

hal-00523588 , version 1 (05-10-2010)

Identifiants

  • HAL Id : hal-00523588 , version 1

Citer

Didier Lime, Olivier Henri Roux. State class Timed Automaton of a Time Petri Net. The 10th International Workshop on Petri Nets and Performance Models, (PNPM'03), 2003, Urbana, United States. pp.124--133. ⟨hal-00523588⟩
227 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More