Publications
[PJCS-96b] Approximate Throughput Computation of a Class of Cooperating Sequential Processes. :382-389.
.
1996.
[239] Approximate Throughput Computation of Stochastic Marked Graphs. Quantitative Methods in Parallel Systems. :175-188.
.
1995.
[247] Approximate Throughput Computation of Stochastic Marked Graphs. IEEE Transactions on Software Engineering. 20(7):526-535.
.
1994.
[RP-92-13] Approximate throughput computation of stochastic marked graphs. Journal of Parallel and distributed computing. 15:282-295.
.
1992.
[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.
[PJCS-RR69-2005] Approximate Throughput Computation of Stochastic Weighted T-Systems.
.
2005.
[RP-87-03] Aproximación a los robots inteligentes. :265-279.
.
1987.
[RP-92-10] An aproximation method for the performance analysis of manufacturing systems based on GSPNs. :46-55.
.
1992.
[GMM06] ArgoSPE: Model-based software performance engineering. 4024:401-410.
.
2006.
[1550] An Assembly Problem with Mobile Robots. ETFA'2014: 19th IEEE International Conference on Emerging Technologies and Factory Automation.
.
2014.
[RP-80-09] Autómata programable multicomputador. Valoración de su capacidad de tratamiento. :609-630.
.
1980.
[1278] An Automated Framework for Formal Verification of Timed Continuous Petri Nets. IEEE Transactions on Industrial Informatics. 6(3):471.
.
2010.
[1079] Automatic Synthesis of Colored Petri Nets for the Control of FMS. IEEE Transactions on Robotics and Automation. 13(3):327-337.
.
1997.
.
1984.
[IPReTeSi99] Autonomous Continuous PT systems. 1639:107-126.
.
1999.
[RP-92-12] B-Fairness and Structural B-Fairness in Petri Net Models of Concurrent Systems. Journal of Computer and System Sciences. 44:447-477.
.
1992.
[910] 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.
.
2002.
[1257] Basic Server Semantics and Performance Monotonicity of Continuous Petri Nets. Discrete Event Dynamic Systems. 19(2):212.
.
2009.
[RP-85-04] Binary-decision graphs for implementation of boolean functions. IEE Proceedings. :175-185.
.
1985.
[1076] 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.
.
1995.
[1307] Bounded Pushdown dimension vs Lempel Ziv information density. arXiv.
.
2007.
[CPSM-RMUCM-93] Boundedness on Stochastic Petri Nets. Revista Matematica de la Universidad Complutense de Madrid. 6:123-136.
.
1993.
[1310] Building maintainable, exhaustive human mitochondrial phylogenies. 17 Annual International Conference on Intelligent Systems for Molecular Biology/8th European Conference.
.
2009.
[1390] Calculation Scheme Based on a Weighted Primitive: Application to Image Processing Transforms. Eurasip Journal on Advances in Signal Processing. :17.
.
2007.
[1398] Calculation Scheme Based on a Weighted Primitive: Application to Image Processing Transforms. Eurasip Journal on Advances in Signal Processing. 2007:17.
.
2007.