Publications
Filters: Author is J. Campos [Clear All Filters]
.
2001.
[PCFB-LAT-13] Tuning Mechanism for IEEE 802.11e EDCA Optimization. IEEE Latin America Transactions. 11(4):1134-1142.
.
2013.
[BCM-TII-11] Timing-failure risk assessment of UML design using Time Petri Net bound techniques. IEEE Transactions on Industrial Informatics. 7(1):90-104.
.
2011.
[State-of-the-art-93] The Timed Coloured Petri Net Formalism Position Paper. 14:3-60.
.
1993.
[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.
[CS-Melbourne-91] Throughput Upper Bounds for Markovian Petri Nets Embedded Subnets and Queueing Networks. :312-321.
.
1991.
[PFMBC-JCST-13] Throughput Quantitative Analysis of EDCA 802.11e in Different Scenarios. Journal of Computer Science & Technology. 13(1):16-23.
.
2013.
[CSS-Melbourne-91] Throughput Lower Bounds for Markovian Petri Nets Transformation Techniques. :322-331.
.
1991.
[CDS-StMalo-97] Structured Solution of Stochastic DSSP Systems. :91-100.
.
1997.
[CDS-TSE-99] Structured Solution of Asynchronously Communicating Stochastic Modules. IEEE Transactions on Software Engineering. 25:147-165.
.
1999.
[CS-LNCS-92] Structural Techniques and Performance Bounds of Stochastic Petri Net Models. 609:352-391.
.
1992.
[SC-Erlangen-95] Structural Performance Analysis of Stochastic Petri Nets. :61-70.
.
1995.
[1482] Structural deadlock prevention policies for Flexible Manufacturing Systems: A Petri net outlook. Formal Methods in Manufacturing. Abstract
.
2014.
[CS-DS-90] Steady State Performance Evaluation of Totally Open Systems of Markovian Sequential Processes. :427-438.
.
1990.
[CS-Lyon-89] Steady State Performance Evaluation of Totally Open Systems of Markovian Sequential Processes. :559-585.
.
1989.
[PJCS-96a] State Machine Reduction for the Approximate Performance Evaluation of Manufacturing Systems Modelled with Cooperating Sequential Processes. :1159-1165.
.
1996.
[GBC-IROS-04] Solving the Mobile Robot Localization Problem Using String Matching Algorithms. :2475-2480.
.
2004.
[MC-LNCS-04] Software Performance Modelling Using UML and Petri Nets. Lecture Notes in Computer Science. 2965:265-289.
.
2004.
.
1998.
[C-MATCH23-98] Response Time Approximation for Stochastic Marked Graphs. :797-817.
.
1998.
[262] A Reachable Throughput Upper Bound for Live and Safe Free Choice Nets. 12th International Conference on Application and Theory of Petri Nets. :237-256.
.
1991.
[CCS-Kyoto-89] Properties and Steady State Performance Bounds for Petri Nets with Unique Repetitive Firing Count Vector. :210-220.
.
1989.
[258] Properties and Performance Bounds for Timed Marked Graphs. IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications. 39(5):386-401.
.
1992.
[CCS-TAC-91] Properties and Performance Bounds for Closed Free Choice Synchronized Monoclass Queueing Networks. IEEE Transactions on Automatic Control. 36:1368-1382.
.
1991. .
2009.