Publications
] Filters: Author is J. Campos [Clear All Filters]
[CSS-Melbourne-91] .
1991. Throughput Lower Bounds for Markovian Petri Nets Transformation Techniques. :322-331.
[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.
[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.
[Campos-thesis-90] .
1990. Performance Bounds for Synchronized Queueing Networks.
[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.
[276] .
1990. Performance Evaluation of Repetitive Automated Manufacturing Systems. IEEE Rensselaer's Second International Conference on Computer Integrated Manufacturing. :74-81.
[CS-DS-90] .
1990. Steady State Performance Evaluation of Totally Open Systems of Markovian Sequential Processes. :427-438.
[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.
[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.
- « first
- ‹ previous
- 1
- 2
- 3
- 4
