Publications
Filters: Author is J. Campos [Clear All Filters]
.
1999.
[CCS-Kyoto-89] Properties and Steady State Performance Bounds for Petri Nets with Unique Repetitive Firing Count Vector. :210-220.
.
1989.
[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.
.
1998.
[GBC-IROS-04] Solving the Mobile Robot Localization Problem Using String Matching Algorithms. :2475-2480.
.
2004.
[PJCS-96a] State Machine Reduction for the Approximate Performance Evaluation of Manufacturing Systems Modelled with Cooperating Sequential Processes. :1159-1165.
.
1996.
[CS-Lyon-89] Steady State Performance Evaluation of Totally Open Systems of Markovian Sequential Processes. :559-585.
.
1989.
[SC-Erlangen-95] Structural Performance Analysis of Stochastic Petri Nets. :61-70.
.
1995.
[CDS-StMalo-97] Structured Solution of Stochastic DSSP Systems. :91-100.
.
1997.
[CSS-Melbourne-91] Throughput Lower Bounds for Markovian Petri Nets Transformation Techniques. :322-331.
.
1991.
[CS-Melbourne-91] Throughput Upper Bounds for Markovian Petri Nets Embedded Subnets and Queueing Networks. :312-321.
.
1991.
[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.
.
2001.
.
2009.
[MCM-WINET03] Analysing Internet Software Retrieval Systems: Modeling and Performance Comparison. Wireless Networks: The Journal of Mobile Communication Computation and Information. 9:223-238.
.
2003.
[247] Approximate Throughput Computation of Stochastic Marked Graphs. IEEE Transactions on Software Engineering. 20(7):526-535.
.
1994.
[PJCS-TSCM07] Approximate Throughput Computation of Stochastic Weighted T-Systems. IEEE Transactions on Systems, Man, and Cybernetics. Part A: Systems and Humans. 37:431-444.
.
2007.
[CPSM-RMUCM-93] Boundedness on Stochastic Petri Nets. Revista Matematica de la Universidad Complutense de Madrid. 6:123-136.
.
1993.
[BC09] Computation of Performance Bounds for Real-time systems using Time Petri Nets. IEEE Transactions on Industrial Informatics. 5(2):168-180.
.
2009.
[CS-PE-93] Embedded Product Form Queueing Networks and the Improvement of Performance Bounds for Petri Net Systems. Performance Evaluation. 18:3-19.
.
1993.
[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.
[Cam-TII-10] Guest Editorial: Special Section on Formal Methods in Manufacturing. IEEE Transactions on Industrial Informatics. 6(2):125-126.
.
2010.
[BC-TSMC-13] 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. 43(5):1167-1181.
.
2013.
[CM-LNCS-06] On the integration of UML and Petri nets in software development. Lecture Notes in Computer Science. 4024:19-36.
.
2006.
[CCS-TAC-91] Properties and Performance Bounds for Closed Free Choice Synchronized Monoclass Queueing Networks. IEEE Transactions on Automatic Control. 36:1368-1382.
.
1991.