Publications
[ARJuReSi06] Deadlock-freeness analysis of continuous mono-T-semiflow Petri nets. IEEE Trans. on Automatic Control. 51:1472-1481.
.
2006.
[1517] The deadlock problem in the control of Flexible Manufacturing Systems: An overview of the Petri net approach. 19th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA'2014).
.
2014.
[1549] Deadlock Prevention Policy for S3PR - Application to Robot Planning. ETFA'2014: 19th IEEE International Conference on Emerging Technologies and Factory Automation.
.
2014.
[1275] Deadlock Control Software for Tow Automated Guided Vehicles using Petri Nets. Proceedings of the International Workshop on Petri Nets and Software Engineering - PNSE'10. :125-140.
.
2010.
[EzRe-04] A Deadlock Avoidance Approach for Non-Sequential Resource Allocation Systems. IEEE Transactions on Systems, Man and Cybernetics. Part-A: Systems and Humans. 34
.
2004.
.
2002.
.
2003.
[1317] Deadlock Analysis in Minimal Adaptive Routing Algorithms using Petri Nets. IEEE International Conference on Systems, Man, and Cybernetics (SMC’10). :2619-2626. Abstract
.
2010.
[1293] Curves that must be retraced. Information and Computation. 209:992--1006.
.
2011.
[1301] Curves that must be retraced. Sixth International Conference on Computability and Complexity in Analysis (CCA 2009).
.
2009.
[1376] COSME: A Distributed Control Platform for Communicating Machine Tools in Agile Manufacturing Systems. 16th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA'2011).
.
2011.
[RP-95-10] Corrección de programas y Redes de Petri de alto nivel. :184-193.
.
1995.
[RP-95-12] Corrección de programas y redes de Petri de alto nivel. :155-164.
.
1995.
[LutMayCVKL] Cook versus Karp Levin Separating Completeness Notions If NP Is Not Small. Theoretical Computer Science. 164:141-163.
.
1996.
[LutMayCVKLb] Cook versus Karp Levin Separating Completeness Notions If NP Is Not Small. 775:415-426.
.
1994.
[673] Convex Geometry and Semiflows in P/T Nets. A Comparative Study of Algorithms for Computation of Minimal P-Semiflows. Advances in Petri Nets 1990. :79-112.
.
1991.
[1006] Convex Geometry and Semiflows in P/T nets. A comparative study of algorithms for computation of minimal P-semiflows. 10th International Conference on Application and Theory of Petri Nets. :74-95.
.
1989.
[1359] Convex geometry and semiflows in P/T nets. A comparative study of algorithms for computation of minimal p-semiflows. Proceedings of Design Methods Based on Nets (DEMON). Esprit Basic Research Action 3148. W.G. 3: Algebra and Proof Methods. Deliverables Covering the Period June 1989 to June 1990.
.
1990.
[1498] Controllability of Timed Continuous Petri Nets with uncontrollable transitions. International Journal of Control. Posted online: 01 Oct 2013
.
2013.
[1371] Control software for a cutting glass machine tool built using the COSME platform. A case study. 7th Annual IEEE Conference on Automation Science and Engineering (CASE 2011).
.
2011.
[1505] Control of Discrete-Event Systems: Automata and Petri-Net Perspectives. Lecture Notes y Control and Information Sciences. 433:478.
.
2013.
[1435] Control of continuous Petri nets using ON/OFF based method. 11th Int. Workshop on Discrete Event Systems.
.
2012.
[1448] Control of continuous Petri nets using ON/OFF based method. 11th Int. Workshop on Discrete Event Systems (WODES'12). :47-53.
.
2012.
[1255] A Control Method for Timed Distributed Continuous Petri nets. ACC'10: Proceedings of the 2010 conference on American Control Conference.
.
2010.
[1497] A Control Method for Distributed Continuous Mono-T-Semiflow Petri nets. International Journal of Control. 87(2)
.
2014.