Add to ORKGInternational audienceThis 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
. In this paper we propose an efficient reachability set based Petri net analysis by introducing dy...
We consider priced timed Petri nets, i.e., unbounded Petri nets where eachtoken carries a real-value...
Abstract. Time-Basic Petri nets, is a powerful formalism for model-ing real-time systems where time ...
International audienceIn order to model resource-consumption or allocation problems in concurrent re...
International audienceIn order to model resource-consumption or allocation problems in concurrent re...
Abstract. We extend discrete-timed Petri nets with a cost model that assigns to-ken storage costs to...
This paper introduces the model of linearly priced timed automata as an extension of timed automata,...
AbstractIn this paper, we prove the decidability of the minimal and maximal reachability problems fo...
In this paper we present an algorithm for efficiently computing optimal cost of reaching a goal stat...
In this paper we present an algorithm for efficiently computing optimal cost of reaching a goal stat...
In this paper we present an algorithm for efficiently computing optimal cost of reaching a goal stat...
In this paper we present an algorithm for efficiently computing optimal cost of reaching a goal stat...
In this paper we present an algorithm for efficiently computing optimal cost of reaching a goal stat...
In this paper we present an algorithm for efficiently computing optimal cost of reaching a goal stat...
Abstract- Deterministic timed transitions are studied in this paper. A new method is developed for r...
. In this paper we propose an efficient reachability set based Petri net analysis by introducing dy...
We consider priced timed Petri nets, i.e., unbounded Petri nets where eachtoken carries a real-value...
Abstract. Time-Basic Petri nets, is a powerful formalism for model-ing real-time systems where time ...
International audienceIn order to model resource-consumption or allocation problems in concurrent re...
International audienceIn order to model resource-consumption or allocation problems in concurrent re...
Abstract. We extend discrete-timed Petri nets with a cost model that assigns to-ken storage costs to...
This paper introduces the model of linearly priced timed automata as an extension of timed automata,...
AbstractIn this paper, we prove the decidability of the minimal and maximal reachability problems fo...
In this paper we present an algorithm for efficiently computing optimal cost of reaching a goal stat...
In this paper we present an algorithm for efficiently computing optimal cost of reaching a goal stat...
In this paper we present an algorithm for efficiently computing optimal cost of reaching a goal stat...
In this paper we present an algorithm for efficiently computing optimal cost of reaching a goal stat...
In this paper we present an algorithm for efficiently computing optimal cost of reaching a goal stat...
In this paper we present an algorithm for efficiently computing optimal cost of reaching a goal stat...
Abstract- Deterministic timed transitions are studied in this paper. A new method is developed for r...
. In this paper we propose an efficient reachability set based Petri net analysis by introducing dy...
We consider priced timed Petri nets, i.e., unbounded Petri nets where eachtoken carries a real-value...
Abstract. Time-Basic Petri nets, is a powerful formalism for model-ing real-time systems where time ...