Publications
] Filters: Author is J. Campos [Clear All Filters]
[Campos-thesis-90] .
1990. Performance Bounds for Synchronized Queueing Networks.
[PJCS-RR69-2005] .
2005. Approximate Throughput Computation of Stochastic Weighted T-Systems.
[BCDM-TSE] .
2004. GSPN Compositional Semantics for UML Statecharts and Sequence Diagrams.
[C-RR-00-00] .
2000. Petri Nets.
[MCM-WINET03] .
2003. Analysing Internet Software Retrieval Systems: Modeling and Performance Comparison. Wireless Networks: The Journal of Mobile Communication Computation and Information. 9:223-238.
[247] .
1994. Approximate Throughput Computation of Stochastic Marked Graphs. IEEE Transactions on Software Engineering. 20(7):526-535.
[PJCS-TSCM07] .
2007. Approximate Throughput Computation of Stochastic Weighted T-Systems. IEEE Transactions on Systems, Man, and Cybernetics. Part A: Systems and Humans. 37:431-444.
[CPSM-RMUCM-93] .
1993. Boundedness on Stochastic Petri Nets. Revista Matematica de la Universidad Complutense de Madrid. 6:123-136.
[BC09] .
2009. Computation of Performance Bounds for Real-time systems using Time Petri Nets. IEEE Transactions on Industrial Informatics. 5(2):168-180.
[CS-PE-93] .
1993. Embedded Product Form Queueing Networks and the Improvement of Performance Bounds for Petri Net Systems. Performance Evaluation. 18:3-19.
[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.
[Cam-TII-10] .
2010. Guest Editorial: Special Section on Formal Methods in Manufacturing. IEEE Transactions on Industrial Informatics. 6(2):125-126.
[BC-TSMC-13] .
In Press. A min-max problem for the computation of the cycle time lower bound in interval-based Time Petri Nets. IEEE Transactions on Systems, Man, and Cybernetics: Systems.
[CM-LNCS-06] .
2006. On the integration of UML and Petri nets in software development. Lecture Notes in Computer Science. 4024:19-36.
[CCS-TAC-91] .
1991. Properties and Performance Bounds for Closed Free Choice Synchronized Monoclass Queueing Networks. IEEE Transactions on Automatic Control. 36:1368-1382.
[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.
[MC-LNCS-04] .
2004. Software Performance Modelling Using UML and Petri Nets. Lecture Notes in Computer Science. 2965:265-289.
[CDS-TSE-99] .
1999. Structured Solution of Asynchronously Communicating Stochastic Modules. IEEE Transactions on Software Engineering. 25:147-165.
[PFMBC-JCST-13] .
2013. Throughput Quantitative Analysis of EDCA 802.11e in Different Scenarios. Journal of Computer Science & Technology. 13(1):16-23.
[BCM-TII-11] .
2011. Timing-failure risk assessment of UML design using Time Petri Net bound techniques. IEEE Transactions on Industrial Informatics. 7(1):90-104.
[PJCS-96b] .
1996. Approximate Throughput Computation of a Class of Cooperating Sequential Processes. :382-389.
[MBCD-wodes02] .
2002. A Compositional Semantics for UML State Machines Aimed at Performance Evaluation. :295-302.
[GUGC-SEIO03] .
2003. Desarrollo de una herramienta de optimización binivel utilizando CPLEX y MATLAB y generación de problemas de prueba. :2931-2944.
[1455] .
2013. EDCA 802.11e Performance under Different Scenarios. Quantitative Analysis. 27th International Conference on Advanced Information Networking and Applications (AINA’13).
