Publications

Export 663 results:
Sort by: Author [ Title (Asc)] Type Year
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
A
[PJCS-96b] Pérez-Jiménez, CJ, Campos J, Silva M.  1996.  Approximate Throughput Computation of a Class of Cooperating Sequential Processes. :382-389.
[239] Campos, J, Colom JM, Jungnitz H, Silva M.  1995.  Approximate Throughput Computation of Stochastic Marked Graphs. Quantitative Methods in Parallel Systems. :175-188.
[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.
[RP-92-13] Sánchez, B, Silva M.  1992.  Approximate throughput computation of stochastic marked graphs. Journal of Parallel and distributed computing. 15:282-295.
[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.
[PJCS-RR69-2005] Pérez-Jiménez, CJ, Campos J, Silva M.  2005.  Approximate Throughput Computation of Stochastic Weighted T-Systems.
[RP-87-03] Tardós, Silva M.  1987.  Aproximación a los robots inteligentes. :265-279.
[RP-92-10] Jungnitz, H, Silva M.  1992.  An aproximation method for the performance analysis of manufacturing systems based on GSPNs. :46-55.
[GMM06] Gómez-Martínez, E, Merseguer J.  2006.  ArgoSPE: Model-based software performance engineering. 4024:401-410.
[1550] Kloetzer, M, Mahulea C.  2014.  An Assembly Problem with Mobile Robots. ETFA'2014: 19th IEEE International Conference on Emerging Technologies and Factory Automation.
[RP-80-09] Silva, M.  1980.  Autómata programable multicomputador. Valoración de su capacidad de tratamiento. :609-630.
[1278] Kloetzer, M, Mahulea C, Belta C, Silva M.  2010.  An Automated Framework for Formal Verification of Timed Continuous Petri Nets. IEEE Transactions on Industrial Informatics. 6(3):471.
[1079] Ezpeleta, J, Colom JM.  1997.  Automatic Synthesis of Colored Petri Nets for the Control of FMS. IEEE Transactions on Robotics and Automation. 13(3):327-337.
[RP-84-01] [Anonymous].  1984.  Automática en la Industria (Proceedings Simposium Nacional IFAC).
[IPReTeSi99] Recalde, L, Teruel E, Silva M.  1999.  Autonomous Continuous PT systems. 1639:107-126.
B
[RP-92-12] Silva, M, Murata T.  1992.  B-Fairness and Structural B-Fairness in Petri Net Models of Concurrent Systems. Journal of Computer and System Sciences. 44:447-477.
[910] Ezpeleta, J, Tricas F, García-Vallés F, Colom JM.  2002.  A Banker's Solution for Deadlock Avoidance in FMS with Flexible Routing and Multiresource States. IEEE Transactions on Robotics and Automation. 18(4):621-625.
[1257] Mahulea, C, Recalde L, Silva M.  2009.  Basic Server Semantics and Performance Monotonicity of Continuous Petri Nets. Discrete Event Dynamic Systems. 19(2):212.
[RP-85-04] Silva, M, David R.  1985.  Binary-decision graphs for implementation of boolean functions. IEE Proceedings. :175-185.
[1076] García-Vallés, F, Colom JM.  1995.  A Boolean Approach to the State Machine Decomposition of Petri Nets with OBDDs. 1995 IEEE International Conference on Systems, Man and Cybernetics. 4:3451-3456.
[1307] Mayordomo, E, Moser P, Albert P.  2007.  Bounded Pushdown dimension vs Lempel Ziv information density. arXiv.
[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.
[1310] Mayordomo, E, Blanco R.  2009.  Building maintainable, exhaustive human mitochondrial phylogenies. 17 Annual International Conference on Intelligent Systems for Molecular Biology/8th European Conference.
C