Optimal-Cost Reachability Analysis Based on Time Petri Nets - Archive ouverte HAL Access content directly
Conference Papers Year : 2018

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.
Fichier principal
Vignette du fichier
boucheneb-ACSD-18.pdf (204.42 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01957173 , version 1 (17-12-2018)

Identifiers

  • HAL Id : hal-01957173 , version 1

Cite

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⟩
60 View
112 Download

Share

Gmail Mastodon Facebook X LinkedIn More