Journal
AUTOMATICA
Volume 41, Issue 4, Pages 605-616Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.automatica.2004.11.007
Keywords
performance evaluation; Petri nets; performance bounds; piecewise linear systems; continuous time
Ask authors/readers for more resources
The number of states in discrete event systems can increase exponentially with respect to the size of the system. A way to face this state explosion problem consists of relaxing the system model, for example by converting it to a continuous one. In the scope of Petri nets, the firing of a transition in a continuous Petri net system is done in a real amount. Hence, the marking (state) of the net system becomes a vector of non-negative real numbers. The main contribution of the paper lies in the computation of throughput bounds for continuous Petri net systems with a single T-semiflow. For that purpose, a branch and bound algorithm is designed. Moreover, it can be relaxed and converted into a linear programming problem. Some conditions, under which the system always reaches the computed bounds, are extracted. The results related to the computation of the bounds can be directly applied to a larger class of nets called mono T-semiflow reducible. (c) 2004 Elsevier Ltd. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available