Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Realizability of Schedules by Stochastic Time Petri Nets with Blocking Semantics (regular paper)

Loïc Hélouët 1, * Karim Kecir 2, 1 
* Corresponding author
1 SUMO - SUpervision of large MOdular and distributed systems
Inria Rennes – Bretagne Atlantique , IRISA-D4 - LANGAGE ET GÉNIE LOGICIEL
Abstract : This paper considers realizability of schedules by stochastic concurrent timed systems. Schedules are high level views of desired executions represented as partial orders decorated with timing constraints, while systems are represented as elementary stochastic time Petri nets. We first consider logical realizability: a schedule is realizable by a net N if it embeds in a time process of N that satisfies all its constraints. However, with continuous time domains, the probability of a time process that realizes a schedule is null. We hence consider probabilistic realizability, of schedules up to some imprecision α, that holds if the probability that N logically realizes S with constraints enlarged by α time units is strictly positive. We show that upon a sensible restriction guaranteeing time progress, logical and probabilistic realizability of a schedule can be checked on the finite set of symbolic prefixes extracted from a bounded unfolding of the net. We give a construction technique for these prefixes and show that they represent all time processes of a net occurring up to a given maximal date. We then show how to verify existence of an embedding and compute the probability of its realization.
Document type :
Preprints, Working Papers, ...
Complete list of metadata

Cited literature [19 references]  Display  Hide  Download
Contributor : Loic Helouet Connect in order to contact the contributor
Submitted on : Monday, March 7, 2016 - 10:38:02 PM
Last modification on : Saturday, June 25, 2022 - 7:44:58 PM
Long-term archiving on: : Sunday, November 13, 2016 - 10:20:20 AM


Files produced by the author(s)


  • HAL Id : hal-01284682, version 1


Loïc Hélouët, Karim Kecir. Realizability of Schedules by Stochastic Time Petri Nets with Blocking Semantics (regular paper). 2016. ⟨hal-01284682⟩



Record views


Files downloads