Publications
] Filters: Author is J. Campos [Clear All Filters]
[CCS-Kyoto-89] .
1989. Properties and Steady State Performance Bounds for Petri Nets with Unique Repetitive Firing Count Vector. :210-220.
[CS-Lyon-89] .
1989. Steady State Performance Evaluation of Totally Open Systems of Markovian Sequential Processes. :559-585.
[278] .
1989. Tight Polynomial Bounds for Steady-State Performance of Marked Graphs. Third IEEE International Workshop on Petri Nets and Performance Models (PNPM'89). :200-209.
[CS-DS-90] .
1990. Steady State Performance Evaluation of Totally Open Systems of Markovian Sequential Processes. :427-438.
[276] .
1990. Performance Evaluation of Repetitive Automated Manufacturing Systems. IEEE Rensselaer's Second International Conference on Computer Integrated Manufacturing. :74-81.
[271] .
1990. 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.
[Campos-thesis-90] .
1990. Performance Bounds for Synchronized Queueing Networks.
[263] .
1991. Improving Throughput Upper Bounds for Net Based Models. IMACS MCTS’91 International Symposium on Modeling and Control of Technological Systems. 1:573-582.
[262] .
1991. A Reachable Throughput Upper Bound for Live and Safe Free Choice Nets. 12th International Conference on Application and Theory of Petri Nets. :237-256.
[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.
[CSS-Melbourne-91] .
1991. Throughput Lower Bounds for Markovian Petri Nets Transformation Techniques. :322-331.
[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.
[C-DEMON-91] .
1991. Performance Analysis of Live and Bounded Free Choice Systems. Studien. 198:38-48.
[CS-LNCS-92] .
1992. Structural Techniques and Performance Bounds of Stochastic Petri Net Models. 609:352-391.
[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.
[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.
[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.
[251] .
1993. Operational Analysis of Timed Petri Nets. 16th International Symposium on Computer Performance Modelling, Measurement and Evaluation (Performance'93).
[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.
[SC-Brussels-93] .
1993. Performance Models Based on Petri Nets. :xiv-xxi.
[RCS-Atlanta-93] .
1993. On Optimal Scheduling in DEDS. :821-826.
