Optimal-Cost Reachability Analysis Based on Time Petri Nets

Abstract : This paper investigates the optimal-cost reachability problem in the context of time Petri nets, where a rate cost is associated with each place. This problem consists in deciding whether or not there exists a sequence of transitions reaching, with minimal cost, a given goal marking. This paper shows that for some subclasses of cost time Petri nets, the optimal-cost reachability problem can be solved more efficiently using a method based on the state classes, without resorting to linear programming or splitting state classes.
Type de document :
Communication dans un congrès
18th International Conference on Application of Concurrency to System Design (ACSD 2018), Jun 2018, Bratislava, Slovakia
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01957173
Contributeur : Didier Lime <>
Soumis le : lundi 17 décembre 2018 - 10:44:17
Dernière modification le : jeudi 7 février 2019 - 15:36:26

Fichier

boucheneb-ACSD-18.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01957173, version 1

Collections

Citation

Hanifa Boucheneb, Didier Lime, Olivier Henri Roux, Charlotte Seidner. Optimal-Cost Reachability Analysis Based on Time Petri Nets. 18th International Conference on Application of Concurrency to System Design (ACSD 2018), Jun 2018, Bratislava, Slovakia. 〈hal-01957173〉

Partager

Métriques

Consultations de la notice

15

Téléchargements de fichiers

12