Publications
Filters: Author is J. Campos [Clear All Filters]
[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.
[276] Performance Evaluation of Repetitive Automated Manufacturing Systems. IEEE Rensselaer's Second International Conference on Computer Integrated Manufacturing. :74-81.
.
1990.
[CS-DS-90] Steady State Performance Evaluation of Totally Open Systems of Markovian Sequential Processes. :427-438.
.
1990.
[278] Tight Polynomial Bounds for Steady-State Performance of Marked Graphs. Third IEEE International Workshop on Petri Nets and Performance Models (PNPM'89). :200-209.
.
1989.
[CCS-Kyoto-89] Properties and Steady State Performance Bounds for Petri Nets with Unique Repetitive Firing Count Vector. :210-220.
.
1989.
[CS-Lyon-89] Steady State Performance Evaluation of Totally Open Systems of Markovian Sequential Processes. :559-585.
.
1989.
.
2003.
- « first
- ‹ previous
- 1
- 2
- 3
- 4