Publications
Filters: First Letter Of Title is A [Clear All Filters]
[RP-86-12] Almacenamiento de imágenes en un computador PDP-11/34. :67-76.
.
1986.
.
2006.
[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.
[IPReTeSi99] Autonomous Continuous PT systems. 1639:107-126.
.
1999.
[360] Analysis of Autonomous Petri Nets with Bulk Services and Arrivals. 11th Int. Conf. on Analysis and Optimization of Systems. Discrete Event Systems. 199:131-143.
.
1994.
[RP-80-09] Autómata programable multicomputador. Valoración de su capacidad de tratamiento. :609-630.
.
1980.
[975] Análisis de programas concurrentes mediante Redes de Petri. VI Congreso de Informática y Automática de la AEIA. :519-523.
.
1985.
[RP-87-03] Aproximación a los robots inteligentes. :265-279.
.
1987.
.
1992.
[RP-92-13] Approximate throughput computation of stochastic marked graphs. Journal of Parallel and distributed computing. 15:282-295.
.
1992.
[1278] An Automated Framework for Formal Verification of Timed Continuous Petri Nets. IEEE Transactions on Industrial Informatics. 6(3):471.
.
2010.
[1279] Approaching Minimum Time Control of Timed Continuous Petri nets. Nonlinear Analysis: Hybrid Systems.
.
2010.
[1400] Algebraic Model of an Arithmetic Unit for TTE-Computable Normalized Rational Numbers. Computability in Europe 2007.
.
2007.
[PMM-ICPE12] Analysis of Bursty Workload-aware Self-adaptive Systems. Third joint WOSP/SIPEW international conference on Performance Engineering - ICPE. :75-84.
.
2012.
[PJCS-96b] Approximate Throughput Computation of a Class of Cooperating Sequential Processes. :382-389.
.
1996.
[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.
[MayAESET] Almost every set in exponential time is P bi immune. Theoretical Computer Science. 136:487-506.
.
1994.
[AESETPBI] Almost every set in exponential time is P-bi-immune. 629:392-400.
.
1992.
.
2011.
[1550] An Assembly Problem with Mobile Robots. ETFA'2014: 19th IEEE International Conference on Emerging Technologies and Factory Automation.
.
2014.
[1552] Accomplish Multi-Robot Tasks Via Petri Net Models. CASE'2015: IEEE Int. Conf. on Automation Science and Engineering.
.
2015.
[RJ_EPEW10] Accurate Performance Estimation for Stochastic Marked Graphs by Bottleneck Regrowing. EPEW'10: Proceedings of the 7th European Performance Engineering Workshop. 6342:175--190. Abstract
.
2010.
[1443] Analysis and Simulation of Manufacturing Systems using SimHPN toolbox. CASE'2011: 7th IEEE Conf. on Automation Science and Engineering.
.
2011.