Publications
Filters: First Letter Of Title is A [Clear All Filters]
[247] Approximate Throughput Computation of Stochastic Marked Graphs. IEEE Transactions on Software Engineering. 20(7):526-535.
.
1994.
[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.
[MayAESET] Almost every set in exponential time is P bi immune. Theoretical Computer Science. 136:487-506.
.
1994.
[BBBCC-QMIPS-94] Annotated Bibliography on Stochastic Petri Nets. 105:25-44.
.
1994.
[1058] Analysis Tools Applied to VHDL. Microprocessing and Microprogramming. The EUROMICRO Journal. 38(1):597-604.
.
1993.
[RP-92-13] Approximate throughput computation of stochastic marked graphs. Journal of Parallel and distributed computing. 15:282-295.
.
1992.
[RP-92-10] An aproximation method for the performance analysis of manufacturing systems based on GSPNs. :46-55.
.
1992.
[AESETPBI] Almost every set in exponential time is P-bi-immune. 629:392-400.
.
1992.
[1348] Análisis structural de redes de Petri, programación lineal y geometría convexa. Departamento de Ingeniería Eléctrica e Informática. Tesis Doctoral
.
1989.
[RP-87-03] Aproximación a los robots inteligentes. :265-279.
.
1987.
[RP-86-12] Almacenamiento de imágenes en un computador PDP-11/34. :67-76.
.
1986.
[975] Análisis de programas concurrentes mediante Redes de Petri. VI Congreso de Informática y Automática de la AEIA. :519-523.
.
1985.
.
1984.
[RP-80-09] Autómata programable multicomputador. Valoración de su capacidad de tratamiento. :609-630.
.
1980.