For the most recent entries see the
Petri Nets Newsletter.
Keyword: linear programming
-
Winkowski, Józef:
Reachability in contextual nets.
2002.
-
Xuandong, Li:
Verifying time petri nets by linear programming.
2001.
-
Jeng, M.D.;
Xie, X.;
Hung, W.Y.;
Liu, C.R.:
An efficient methods for obtaining performance bounds of semiconductor manufacturing systems.
1999.
-
Yen, H.C.:
Integer linear programming and the analysis of some Petri net problems.
1999.
-
Liu, Z.:
Performance analysis of stochastic timed Petri nets using linear programming approach.
1998.
-
Campos, Javier;
Colom, José Maria;
Silva, Manuel:
Improving Throughput Upper Bounds for Net Based Models of Manufacturing Systems.
1991.
-
Campos, Javier;
Colom, José M.:
A Reachable Throughput Upper Bound for Live and Safe Free Choice Nets.
1991.
-
Campos, Javier;
Chiola, Giovanni;
Silva, Manual:
Ergodicity and Throughput Bounds of Petri Nets with Unique Consistent Firing Count Vector.
1991.
-
Campos, J.;
Chiola, G.;
Silva, M.:
Properties and Steady-State Performance Bounds for Petri Nets with Unique Repetitive Firing Count Vector.
1990.
-
Campos, J.;
Colom, J.M.;
Silva, M.:
Performance Evaluation of Repetitive Automated Manufacturing Systems.
1990.
-
Morioka, S.;
Yamada, T.:
Performance Evaluation of Marked Graphs by Linear Programming.
1990.
-
Campos, Javier;
Chiola, Giovanni;
Colom, José Maria;
Silva, Manuel:
Properties and Performance Bounds for Timed Marked Graphs.
1990.
-
Laserre, Jean B.;
Mahey, Philippe:
Using Linear Programming in Petri Net Analysis.
1989.
-
Campos, J.;
Chiola, G.;
Colom, J.M.;
Silva, M.:
Tight Polynomial Bounds for Steady-State Performance of Marked Graphs.
1989.
Do you need a refined search? Try our search engine
which allows complex field-based queries.
Back to the Petri Nets Bibliography