Probabilistic Time Petri Nets - Archive ouverte HAL Access content directly
Conference Papers Year : 2016

Probabilistic Time Petri Nets

Yrvann Emzivat
Benoit Delahaye


We introduce a new model for the design of concurrent sto-chastic real-time systems. Probabilistic time Petri nets (PTPN) are an extension of time Petri nets in which the output of tokens is randomised. Such a design allows us to elegantly solve the hard problem of combining probabilities and concurrency. This model further benefits from the con-cision and expressive power of Petri nets. Furthermore, the usual tools for the analysis of time Petri nets can easily be adapted to our probabilistic setting. More precisely, we show how a Markov decision process (MDP) can be derived from the classic atomic state class graph construction. We then establish that the schedulers of the PTPN and the adversaries of the MDP induce the same Markov chains. As a result, this construction notably preserves the lower and upper bounds on the probability of reaching a given target marking. We also prove that the simpler original state class graph construction cannot be adapted in a similar manner for this purpose.
Fichier principal
Vignette du fichier
PN16.pdf (430.15 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01590900 , version 1 (20-09-2017)


  • HAL Id : hal-01590900 , version 1


Yrvann Emzivat, Benoit Delahaye, Didier Lime, Olivier Henri Roux. Probabilistic Time Petri Nets. 37th INTERNATIONAL CONFERENCE ON APPLICATIONS AND THEORY OF PETRI NETS AND CONCURRENCY, Jun 2016, Torun, Poland. pp.261-280. ⟨hal-01590900⟩
297 View
82 Download


Gmail Facebook Twitter LinkedIn More