Publications

Export 85 results:
Sort by: Author Title [ Type (Asc)] Year
Filters: Author is J. Campos  [Clear All Filters]
Conference Paper
[C-Zaragoza-99] Campos, J.  1999.  PNPM99-PAPM99-NSMC99 Tutorial: Properties and Bounds on P/T Nets.
[CCS-Kyoto-89] Campos, J, Chiola G, Silva M.  1989.  Properties and Steady State Performance Bounds for Petri Nets with Unique Repetitive Firing Count Vector. :210-220.
[262] Campos, J, Colom JM.  1991.  A Reachable Throughput Upper Bound for Live and Safe Free Choice Nets. 12th International Conference on Application and Theory of Petri Nets. :237-256.
[PJC-98] Pérez-Jiménez, CJ, Campos J.  1998.  A Response Time Approximation Technique for Stochastic General PT Systems.
[GBC-IROS-04] González-Buesa, C, Campos J.  2004.  Solving the Mobile Robot Localization Problem Using String Matching Algorithms. :2475-2480.
[PJCS-96a] Pérez-Jiménez, CJ, Campos J, Silva M.  1996.  State Machine Reduction for the Approximate Performance Evaluation of Manufacturing Systems Modelled with Cooperating Sequential Processes. :1159-1165.
[CS-Lyon-89] Campos, J, Silva M.  1989.  Steady State Performance Evaluation of Totally Open Systems of Markovian Sequential Processes. :559-585.
[SC-Erlangen-95] Silva, M, Campos J.  1995.  Structural Performance Analysis of Stochastic Petri Nets. :61-70.
[CDS-StMalo-97] Campos, J, Donatelli S, Silva M.  1997.  Structured Solution of Stochastic DSSP Systems. :91-100.
[CSS-Melbourne-91] Campos, J, Sánchez B, Silva M.  1991.  Throughput Lower Bounds for Markovian Petri Nets Transformation Techniques. :322-331.
[CS-Melbourne-91] Campos, J, Silva M.  1991.  Throughput Upper Bounds for Markovian Petri Nets Embedded Subnets and Queueing Networks. :312-321.
[278] Campos, J, Chiola G, Colom JM, Silva M.  1989.  Tight Polynomial Bounds for Steady-State Performance of Marked Graphs. Third IEEE International Workshop on Petri Nets and Performance Models (PNPM'89). :200-209.
[MCM-JJCC-01] Merseguer, J, Campos J, Mena E.  2001.  Web Based Versus Mobile Agent Based Software Retrieval Systems: Performance Comparison. :299-312.
Conference Proceedings
Journal Article
[MCM-WINET03] Merseguer, J, Campos J, Mena E.  2003.  Analysing Internet Software Retrieval Systems: Modeling and Performance Comparison. Wireless Networks: The Journal of Mobile Communication Computation and Information. 9:223-238.
[247] Campos, J, Colom JM, Jungnitz H, Silva M.  1994.  Approximate Throughput Computation of Stochastic Marked Graphs. IEEE Transactions on Software Engineering. 20(7):526-535.
[PJCS-TSCM07] Pérez-Jiménez, CJ, Campos J, Silva M.  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] Campos, J, Plo BF, Miguel M.  1993.  Boundedness on Stochastic Petri Nets. Revista Matematica de la Universidad Complutense de Madrid. 6:123-136.
[BC09] Bernardi, S, Campos J.  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] Campos, J, Silva M.  1993.  Embedded Product Form Queueing Networks and the Improvement of Performance Bounds for Petri Net Systems. Performance Evaluation. 18:3-19.
[CCS-TSE-91] Campos, J, Chiola G, Silva M.  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] Campos, J.  2010.  Guest Editorial: Special Section on Formal Methods in Manufacturing. IEEE Transactions on Industrial Informatics. 6(2):125-126.
[BC-TSMC-13] Bernardi, S, Campos J.  2013.  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.
[CM-LNCS-06] Campos, J, Merseguer J.  2006.  On the integration of UML and Petri nets in software development. Lecture Notes in Computer Science. 4024:19-36.
[CCS-TAC-91] Campos, J, Chiola G, Silva M.  1991.  Properties and Performance Bounds for Closed Free Choice Synchronized Monoclass Queueing Networks. IEEE Transactions on Automatic Control. 36:1368-1382.