Publications
Filters: First Letter Of Last Name is C [Clear All Filters]
[C-MATCH23-98] Response Time Approximation for Stochastic Marked Graphs. :797-817.
.
1998.
[C-MATCH8-98] Performance Measures and Basic Properties. :285-304.
.
1998.
.
1998.
[SC-MATCH20-98] Introduction to Net Driven Decomposition Techniques. :693-718.
.
1998.
.
1998.
.
1997.
[CDS-StMalo-97] Structured Solution of Stochastic DSSP Systems. :91-100.
.
1997.
[PJCS-96a] State Machine Reduction for the Approximate Performance Evaluation of Manufacturing Systems Modelled with Cooperating Sequential Processes. :1159-1165.
.
1996.
[PJCS-96b] Approximate Throughput Computation of a Class of Cooperating Sequential Processes. :382-389.
.
1996.
.
1996.
[EDA-book-95] Estructuras de Datos y Algoritmos.
.
1995.
.
1995.
[SC-Erlangen-95] Structural Performance Analysis of Stochastic Petri Nets. :61-70.
.
1995.
[BBBCC-QMIPS-94] Annotated Bibliography on Stochastic Petri Nets. 105:25-44.
.
1994.
[CPSM-RMUCM-93] Boundedness on Stochastic Petri Nets. Revista Matematica de la Universidad Complutense de Madrid. 6:123-136.
.
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.
[CS-LNCS-92] Structural Techniques and Performance Bounds of Stochastic Petri Net Models. 609:352-391.
.
1992.
[C-DEMON-91] Performance Analysis of Live and Bounded Free Choice Systems. Studien. 198:38-48.
.
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.