TCTL model checking of Time Petri Nets - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Logic and Computation Année : 2009

TCTL model checking of Time Petri Nets

Résumé

In this paper, we consider \emph{subscript} TCTL for Time Petri Nets (TPN-TCTL) for which temporal operators are extended with a time interval, specifying a time constraint on the firing sequences. We prove that the model-checking of a TPN-TCTL formula on a bounded TPN is decidable and is a PSPACE-complete problem. We propose a zone based state space abstraction that preserves marking reachability and traces of the TPN. As for Timed Automata (TA), the abstraction may use an over-approximation operator on zones to enforce the termination. A coarser (and efficient) abstraction is then provided and proved exact w.r.t. marking reachability and traces (LTL properties). Finally, we consider a subset of TPN-TCTL properties for which it is possible to propose efficient on-the-fly model-checking algorithms. Our approach consists in computing and exploring the zone based state space abstraction

Domaines

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

Dates et versions

hal-00489070 , version 1 (03-06-2010)

Identifiants

Citer

Hanifa Boucheneb, Guillaume Gardey, Olivier Henri Roux. TCTL model checking of Time Petri Nets. Journal of Logic and Computation, 2009, 19 (6), pp.1509-1540. ⟨10.1093/logcom/exp036⟩. ⟨hal-00489070⟩
210 Consultations
909 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More