Publications
] Filters: First Letter Of Last Name is C [Clear All Filters]
[1319] .
2010. An Algorithm to Compute the Minimal Siphons in $S^4PR$ Nets. 10th International Workshop on Discrete Event Systems (WODES’2010). :18-23.
[1413] .
2012. An algorithm to compute the minimal siphons in S4PR nets. Discrete Event Dynamic Systems. 22(4):403-428.
[975] .
1985. Análisis de programas concurrentes mediante Redes de Petri. VI Congreso de Informática y Automática de la AEIA. :519-523.
[1348] .
1989. 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
[MCM-WINET03] .
2003. Analysing Internet Software Retrieval Systems: Modeling and Performance Comparison. Wireless Networks: The Journal of Mobile Communication Computation and Information. 9:223-238.
[360] .
1994. 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.
[1058] .
1993. Analysis Tools Applied to VHDL. Microprocessing and Microprogramming. The EUROMICRO Journal. 38(1):597-604.
[1522] .
2014. Analyzing Phylogenetic Treeswith Timed and Probabilistic Model Checking: The Lactose Persistance Case Study. Journal of Integrative Bioinformatics. 11(3)
[BBBCC-QMIPS-94] .
1994. Annotated Bibliography on Stochastic Petri Nets. 105:25-44.
[1328] .
2001. Application and Theory of Petri Nets 2001. Lecture Notes in Computer Science. 2075
[1469] .
2013. Application and Theory of Petri Nets and Concurrency. 34th International Conference, PETRI NETS 2013. 7927
[PJCS-96b] .
1996. Approximate Throughput Computation of a Class of Cooperating Sequential Processes. :382-389.
[239] .
1995. Approximate Throughput Computation of Stochastic Marked Graphs. Quantitative Methods in Parallel Systems. :175-188.
[247] .
1994. Approximate Throughput Computation of Stochastic Marked Graphs. IEEE Transactions on Software Engineering. 20(7):526-535.
[PJCS-TSCM07] .
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] .
2005. Approximate Throughput Computation of Stochastic Weighted T-Systems.
[1079] .
1997. Automatic Synthesis of Colored Petri Nets for the Control of FMS. IEEE Transactions on Robotics and Automation. 13(3):327-337.
[910] .
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.
[1076] .
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.
[CPSM-RMUCM-93] .
1993. Boundedness on Stochastic Petri Nets. Revista Matematica de la Universidad Complutense de Madrid. 6:123-136.
[1390] .
2007. Calculation Scheme Based on a Weighted Primitive: Application to Image Processing Transforms. Eurasip Journal on Advances in Signal Processing. :17.
[1332] .
2002. Checking Redundancies in Supervisory Control. A Complexity Result. 15th Triennial World Congress of the International Federation of Automatic Control (IFAC).
[204] .
1997. Choice-free Petri Nets: A Model for Deterministic Concurrent Systems with Bulk Services and Arrivals. IEEE Transactions on Systems, Man and Cybernetics. Part A: Systems and Humans. 27(1):73-83.
[1083] .
1998. A Class of Well Structured Petri Nets for Flexible Manufacturing Systems. Application and Theory of Petri Nets 1998. :64-83.
