Skip to Main content Skip to Navigation
Conference papers

Unfolding of time Petri nets for quantitative time analysis

Abstract : The verification of properties on a Time Petri net is often based on the state class graph. For a highly concurrent system, the construction of a state graph often faces to the problem of combinatory explosion. This problem is due to the systematic interleaving of concurrent transitions. This paper proposes a new method of unfolding limiting as much as possible interleavings. This unfolding keeps a partial order execution and interleaving are hold on when their allow to put all conflicts in a total order. The method gives a way to generate a complete finite prefix unfolding based on the construction of the exhaustive set of scenarios on a safe time Petri net. Moreover, the method allows various quantitative time analyses based on the complete finite prefix unfolding and on a permanent time database.
Document type :
Conference papers
Complete list of metadata

Cited literature [23 references]  Display  Hide  Download
Contributor : David Delfieu <>
Submitted on : Tuesday, October 11, 2011 - 1:42:26 PM
Last modification on : Thursday, February 7, 2019 - 2:23:01 PM
Long-term archiving on: : Tuesday, November 13, 2012 - 4:25:48 PM


Files produced by the author(s)


  • HAL Id : hal-00631054, version 1



David Delfieu, Medesu Sogbohossou. Unfolding of time Petri nets for quantitative time analysis. International Workshop pn Timing and Stochasticity in Petri nets and pther models of concurrency, Jun 2009, Paris, France. pp.31-45. ⟨hal-00631054⟩



Record views


Files downloads