TCTL model checking of Time Petri Nets

Abstract : 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
Document type :
Journal articles
Liste complète des métadonnées

Cited literature [39 references]  Display  Hide  Download
Contributor : Olivier Henri Roux <>
Submitted on : Thursday, June 3, 2010 - 5:51:19 PM
Last modification on : Wednesday, December 19, 2018 - 3:02:04 PM
Document(s) archivé(s) le : Friday, September 17, 2010 - 12:52:51 PM


Files produced by the author(s)




Hanifa Boucheneb, Guillaume Gardey, Olivier Henri Roux. TCTL model checking of Time Petri Nets. Journal of Logic and Computation, Oxford University Press (OUP), 2009, 19 (6), pp.1509-1540. ⟨10.1093/logcom/exp036⟩. ⟨hal-00489070⟩



Record views


Files downloads