Realizability of schedules by stochastic time Petri nets with blocking semantics - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Science of Computer Programming Year : 2018

Realizability of schedules by stochastic time Petri nets with blocking semantics

Fichier principal
Vignette du fichier
TCS-LHKK.pdf (641.1 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01942241 , version 1 (03-12-2018)

Identifiers

Cite

Loïc Hélouët, Karim Kecir. Realizability of schedules by stochastic time Petri nets with blocking semantics. Science of Computer Programming, 2018, 157, pp.71-102. ⟨10.1016/j.scico.2017.12.004⟩. ⟨hal-01942241⟩
57 View
162 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More