Publications
] Filters: Author is J. Campos [Clear All Filters]
[239] .
1995. Approximate Throughput Computation of Stochastic Marked Graphs. Quantitative Methods in Parallel Systems. :175-188.
[243] .
1995. Functional and Performance Analysis of Cooperating Sequential Processes. Quantitative Methods in Parallel Systems. :52-65.
[EDA-book-95] .
1995. Estructuras de Datos y Algoritmos.
[247] .
1994. Approximate Throughput Computation of Stochastic Marked Graphs. IEEE Transactions on Software Engineering. 20(7):526-535.
[245] .
1994. 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.
[246] .
1994. A General Iterative Technique for Approximate Throughput Computation of Stochastic Marked Graphs. Performance Evaluation of parallel and distributed systems. Solution Methods. :265-283.
[248] .
1994. Functional and Performance Analysis of Cooperating Sequential Processes. Performance Evaluation of parallel and distributed systems. Solution Methods. :234-251.
[249] .
1994. Functional and Performance Analysis of Cooperating Sequential Processes. 11th International Conference on Analysis and Optimization Systems. Discrete Event Systems. :169-175.
[BBBCC-QMIPS-94] .
1994. Annotated Bibliography on Stochastic Petri Nets. 105:25-44.
[CS-PE-93] .
1993. Embedded Product Form Queueing Networks and the Improvement of Performance Bounds for Petri Net Systems. Performance Evaluation. 18:3-19.
[RCS-Atlanta-93] .
1993. On Optimal Scheduling in DEDS. :821-826.
[SC-Brussels-93] .
1993. Performance Models Based on Petri Nets. :xiv-xxi.
[250] .
1993. 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.
[252] .
1993. 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.
[251] .
1993. Operational Analysis of Timed Petri Nets. 16th International Symposium on Computer Performance Modelling, Measurement and Evaluation (Performance'93).
[CPSM-RMUCM-93] .
1993. Boundedness on Stochastic Petri Nets. Revista Matematica de la Universidad Complutense de Madrid. 6:123-136.
[State-of-the-art-93] .
1993. The Timed Coloured Petri Net Formalism Position Paper. 14:3-60.
[258] .
1992. Properties and Performance Bounds for Timed Marked Graphs. IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications. 39(5):386-401.
[259] .
1992. Improving Throughput Upper Bounds for Net Based Models. Robotics and Flexible Manufacturing Systems. :281-294.
[269] .
1992. Linear Algebraic Techniques for the Analysis of Petri Nets. Recent Advances in Mathematical Theory of Systems, Control, Networks, and Signal Processing II. :35-42.
[CS-LNCS-92] .
1992. Structural Techniques and Performance Bounds of Stochastic Petri Net Models. 609:352-391.
[C-DEMON-91] .
1991. Performance Analysis of Live and Bounded Free Choice Systems. Studien. 198:38-48.
[CCS-TSE-91] .
1991. Ergodicity and Throughput Bounds of Petri Nets with Unique Consistent Firing Count Vector. IEEE Transactions on Software Engineering. 17:117-125.
[CCS-TAC-91] .
1991. Properties and Performance Bounds for Closed Free Choice Synchronized Monoclass Queueing Networks. IEEE Transactions on Automatic Control. 36:1368-1382.
[CS-Melbourne-91] .
1991. Throughput Upper Bounds for Markovian Petri Nets Embedded Subnets and Queueing Networks. :312-321.
