Skip to Main content Skip to Navigation
Conference papers

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.
Document type :
Conference papers
Complete list of metadata

Cited literature [13 references]  Display  Hide  Download
Contributor : Didier Lime <>
Submitted on : Monday, December 17, 2018 - 10:44:17 AM
Last modification on : Tuesday, January 5, 2021 - 4:26:07 PM
Long-term archiving on: : Monday, March 18, 2019 - 1:54:58 PM


Files produced by the author(s)


  • HAL Id : hal-01957173, version 1


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⟩



Record views


Files downloads