Model checking of Time Petri Nets using the State Class Timed Automaton

Abstract : 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), which we call the state class timed automaton. We consider bounded TPN, whose underlying net is not necessarily bounded. We prove that our translation preserves the behavioural semantics of the TPN (the initial TPN and the obtained TA are proved timed-bisimilar). It allows us to check real- time properties on TPN by using the state class TA. This can be done efficiently thanks to a reduction of the number of clocks. We have implemented the method, and give some experimental results illustrating the efficiency of the translation algorithm in terms of number of clocks. Using the state class TA, we also give a framework for expressing and efficiently verifying TCTL properties on the initial TPN.
Document type :
Journal articles
Liste complète des métadonnées

Cited literature [32 references]  Display  Hide  Download
Contributor : Didier Lime <>
Submitted on : Thursday, June 3, 2010 - 2:57:25 PM
Last modification on : Wednesday, December 19, 2018 - 3:02:04 PM
Document(s) archivé(s) le : Friday, September 17, 2010 - 12:12:59 PM


Files produced by the author(s)



Didier Lime, Olivier Henri Roux. Model checking of Time Petri Nets using the State Class Timed Automaton. Discrete Event Dynamic Systems, Springer Verlag, 2006, 16 (2), pp.179-205. ⟨10.1007/s10626-006-8133-9⟩. ⟨hal-00488957⟩



Record views


Files downloads