Publications
Filters: Author is M. Silva [Clear All Filters]
[239] Approximate Throughput Computation of Stochastic Marked Graphs. Quantitative Methods in Parallel Systems. :175-188.
.
1995.
[SC-Erlangen-95] Structural Performance Analysis of Stochastic Petri Nets. :61-70.
.
1995.
[243] Functional and Performance Analysis of Cooperating Sequential Processes. Quantitative Methods in Parallel Systems. :52-65.
.
1995.
[245] Operational Analysis of Timed Petri Nets and Application to the Computation of Performance Bounds. Performance Evaluation of parallel and distributed systems. Solution Methods. :197-213.
.
1994.
[246] A General Iterative Technique for Approximate Throughput Computation of Stochastic Marked Graphs. Performance Evaluation of parallel and distributed systems. Solution Methods. :265-283.
.
1994.
[247] Approximate Throughput Computation of Stochastic Marked Graphs. IEEE Transactions on Software Engineering. 20(7):526-535.
.
1994.
[248] Functional and Performance Analysis of Cooperating Sequential Processes. Performance Evaluation of parallel and distributed systems. Solution Methods. :234-251.
.
1994.
[249] Functional and Performance Analysis of Cooperating Sequential Processes. 11th International Conference on Analysis and Optimization Systems. Discrete Event Systems. :169-175.
.
1994.
[250] Operational Analysis of Timed Petri Nets and Application to the Computation of Performance Bounds. IEEE 5th International Workshop on Petri Nets and Performance Models (PNPM'93). :128-137.
.
1993.
[251] Operational Analysis of Timed Petri Nets. 16th International Symposium on Computer Performance Modelling, Measurement and Evaluation (Performance'93).
.
1993.
[252] A General Iterative Technique for Approximate Throughput Computation of Stochastic Marked Graphs. IEEE 5th International Workshop on Petri Nets and Performance Models (PNPM'93). :138-147.
.
1993.
[CS-PE-93] Embedded Product Form Queueing Networks and the Improvement of Performance Bounds for Petri Net Systems. Performance Evaluation. 18:3-19.
.
1993.
[RCS-Atlanta-93] On Optimal Scheduling in DEDS. :821-826.
.
1993.
[SC-Brussels-93] Performance Models Based on Petri Nets. :xiv-xxi.
.
1993.
[State-of-the-art-93] The Timed Coloured Petri Net Formalism Position Paper. 14:3-60.
.
1993.
[258] Properties and Performance Bounds for Timed Marked Graphs. IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications. 39(5):386-401.
.
1992.
[259] Improving Throughput Upper Bounds for Net Based Models. Robotics and Flexible Manufacturing Systems. :281-294.
.
1992.
[CS-LNCS-92] Structural Techniques and Performance Bounds of Stochastic Petri Net Models. 609:352-391.
.
1992.
[263] Improving Throughput Upper Bounds for Net Based Models. IMACS MCTS’91 International Symposium on Modeling and Control of Technological Systems. 1:573-582.
.
1991.
[CCS-TAC-91] Properties and Performance Bounds for Closed Free Choice Synchronized Monoclass Queueing Networks. IEEE Transactions on Automatic Control. 36:1368-1382.
.
1991.
[CCS-TSE-91] Ergodicity and Throughput Bounds of Petri Nets with Unique Consistent Firing Count Vector. IEEE Transactions on Software Engineering. 17:117-125.
.
1991.
[CS-Melbourne-91] Throughput Upper Bounds for Markovian Petri Nets Embedded Subnets and Queueing Networks. :312-321.
.
1991.
[CSS-Melbourne-91] Throughput Lower Bounds for Markovian Petri Nets Transformation Techniques. :322-331.
.
1991.
[269] Linear Algebraic Techniques for the Analysis of Petri Nets. Recent Advances in Mathematical Theory of Systems, Control, Networks, and Signal Processing II. :35-42.
.
1992.
[271] On liveness analysis through linear algebraic techniques. Proceedings of Design Methods Based on Nets (DEMON). Esprit Basic Research Action 3148. W.G. 3: Algebra and Proof Methods. Deliverables Covering the Period June 1989 to June 1990.
.
1990.