Timed Petri Nets with (restricted) Urgency

Abstract : Time Petri Nets (TPN) [Mer74] and Timed Petri Nets [Wal83] are two incomparable classes of concurrent models with timing constraints: urgency cannot be expressed using Timed Petri Nets, while TPNs can only keep track of a bounded number of continuous values ("clocks"). We introduce Timed Petri Nets with Urgency, extending Timed Petri Nets with the main features of TPNs. We present upto-our-knowledge the first decidability results for Petri Net vari-ants combining time, urgency and unbounded places. First, we obtain decidability of control-state reachability for the subclass of Timed Petri Nets with Urgency where urgency constraints can only be used on bounded places. By restricting this class to use a finite number of "clocks", we further show decidability of (marking) reachability. Formally, this class corresponds to TPNs under a new, yet natural, timed semantics where urgency constraints are restricted to bounded places. Fur-ther, under their original semantics, we obtain the decidability of reachability for a more restricted class of TPNs. TPNs
keyword : Petri nets
Type de document :
Pré-publication, Document de travail
2014
Liste complète des métadonnées

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

https://hal.inria.fr/hal-01088997
Contributeur : Loic Helouet <>
Soumis le : samedi 29 novembre 2014 - 21:54:15
Dernière modification le : samedi 21 juillet 2018 - 14:12:01
Document(s) archivé(s) le : vendredi 14 avril 2017 - 23:41:20

Fichier

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

Identifiants

  • HAL Id : hal-01088997, version 1

Citation

Sundararaman Akshay, Blaise Genest, Loïc Hélouët. Timed Petri Nets with (restricted) Urgency. 2014. 〈hal-01088997〉

Partager

Métriques

Consultations de la notice

386

Téléchargements de fichiers

100