Polynomial Throughput Bounds for Equal Conflict Petri Nets with Multi-guarded Transitions

Author

Julvez, Jorge

Author_Institution

Dept. of Software, Univ. Politec. de Catalunya, Barcelona

fYear

2008

fDate

14-17 Sept. 2008

Firstpage

225

Lastpage

234

Abstract

Early evaluation is a strategy that aims at enhancing the system performance by executing operations as soon as enough information is available. A common unit that allows early evaluation is the multiplexer: its output can be produced as soon as data is available in the selected channel, without waiting for data in the other channels. Petri nets can model early evaluation of operations by associating several guards with each transition. A multi-guarded transition can fire as soon as the guard selected for the next firing is satisfied. This paper proposes a linear programming problem to compute throughput bounds for equal conflict Petri nets with multi-guarded transitions.

Keywords

Petri nets; linear programming; multiplexing equipment; performance evaluation; conflict Petri nets; early evaluation; linear programming problem; multiguarded transitions; multiplexer; polynomial throughput bounds; Availability; Circuits; Fires; Linear programming; Multiplexing; Petri nets; Polynomials; System performance; Tellurium; Throughput; Petri nets; early evaluation; throughput bounds;

fLanguage

English

Publisher

ieee

Conference_Titel

Quantitative Evaluation of Systems, 2008. QEST '08. Fifth International Conference on

Conference_Location

St. Malo

Print_ISBN

978-0-7695-3360-5

Type

conf

DOI

10.1109/QEST.2008.28

Filename

4634975