Publications
Filters: Author is J. Campos [Clear All Filters]
[LGMC-WOSP02] From UML Activity Diagrams to Stochastic Petri Nets: Application to Software Performance Engineering. :25-36.
.
2004.
[LGMC-02b] On the Use of Formal Models in Software Performance Evaluation. :367-387.
.
2002.
.
2002.
[MBCD-wodes02] A Compositional Semantics for UML State Machines Aimed at Performance Evaluation. :295-302.
.
2002.
[Cam-EVI-01] Evaluación de Prestaciones de Sistemas Concurrentes Modelados con Redes de Petri. :141-156.
.
2001.
[MCM-JJCC-01] Web Based Versus Mobile Agent Based Software Retrieval Systems: Performance Comparison. :299-312.
.
2001.
[MCM-LNCS-01] A Performance Engineering Case Study: Software Retrieval System. 2047:317-332.
.
2001.
.
2001.
[C-RR-00-00] Petri Nets.
.
2000.
[MCM-JJCC-00] Evaluating Performance on Mobile Agents Software Design. :291-307.
.
2000.
[MCM-SEPN-00] Performance Evaluation for the Design of Agent Based Systems: A Petri Net Approach. :1-20.
.
2000.
[MCM-WOSP-00] A Pattern Based Approach to Model Software Performance. :137-142.
.
2000.
.
1999.
[C-MATCH17-98] Performance Bounds. :587-635.
.
1998.
[C-MATCH23-98] Response Time Approximation for Stochastic Marked Graphs. :797-817.
.
1998.
[C-MATCH8-98] Performance Measures and Basic Properties. :285-304.
.
1998.
.
1997.
[EDA-book-95] Estructuras de Datos y Algoritmos.
.
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.
[C-DEMON-91] Performance Analysis of Live and Bounded Free Choice Systems. Studien. 198:38-48.
.
1991.
[Campos-thesis-90] Performance Bounds for Synchronized Queueing Networks.
.
1990.
[CM-LNCS-06] On the integration of UML and Petri nets in software development. Lecture Notes in Computer Science. 4024:19-36.
.
2006.
[MC-LNCS-04] Software Performance Modelling Using UML and Petri Nets. Lecture Notes in Computer Science. 2965:265-289.
.
2004.
[GBC-IROS-04] Solving the Mobile Robot Localization Problem Using String Matching Algorithms. :2475-2480.
.
2004.