학술논문
Optimal-Cost Reachability Analysis Based on Time Petri Nets
Document Type
Conference
Source
2018 18th International Conference on Application of Concurrency to System Design (ACSD) ACSD Application of Concurrency to System Design (ACSD), 2018 18th International Conference on. :30-39 Jun, 2018
Subject
Language
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 a given goal marking is reachable and providing, in case it is reachable, a sequence leading at lower cost to the 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.