Realizability of Schedules by Stochastic Time Petri Nets with Blocking Semantics

Loïc Hélouët 1 Karim Kecir 1
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 up to α time units, that holds if the probability that N logically realizes S with constraints enlarged by α is strictly positive. 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.
Type de document :
Communication dans un congrès
Fabrice Kordon and Daniel Moldt. 37th International Conference, PETRI NETS 2016, Jun 2016, Torun, Poland. Lecture Notes in Computer Science, pp.155-175, 2016, Application and Theory of Petri Nets and Concurrency. 〈http://acsd2016.mat.umk.pl/〉. 〈10.1007/978-3-319-39086-4_11〉
Liste complète des métadonnées

Littérature citée [18 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01379424
Contributeur : Loic Helouet <>
Soumis le : mardi 11 octobre 2016 - 14:55:35
Dernière modification le : mercredi 16 mai 2018 - 11:24:07
Document(s) archivé(s) le : samedi 4 février 2017 - 19:04:28

Fichier

Schedules(PN2016).pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Citation

Loïc Hélouët, Karim Kecir. Realizability of Schedules by Stochastic Time Petri Nets with Blocking Semantics. Fabrice Kordon and Daniel Moldt. 37th International Conference, PETRI NETS 2016, Jun 2016, Torun, Poland. Lecture Notes in Computer Science, pp.155-175, 2016, Application and Theory of Petri Nets and Concurrency. 〈http://acsd2016.mat.umk.pl/〉. 〈10.1007/978-3-319-39086-4_11〉. 〈hal-01379424〉

Partager

Métriques

Consultations de la notice

394

Téléchargements de fichiers

131