Publications

Export 56 results:
Sort by: [ Author (Asc)] Title Type Year
Filters: First Letter Of Last Name is E  [Clear All Filters]
A B C D [E] F G H I J K L M N O P Q R S T U V W X Y Z   [Show ALL]
F
[1441] F, F, B L\"owe, E M.  2012.  CiE: Programs, Proofs, Processes (Special Issue). Theory of Computing Systems. 51(3)
[1251] Franceschelli, M, Egerstedt M, Giua A, Mahulea C.  2009.  Constrained invariant motions for networked multi-agent systems. ACC'09: Proceedings of the 2009 conference on American Control Conference.
E
[ICEsSi91b] Esparza, J, Silva M.  1991.  Top-Down Synthesis of Live and Bounded Free Choice Nets. Advances in Petri Nets 91. 524:118-139.
[ICEsSi90a] Esparza, J, Silva M.  1991.  Circuits, Handles, Bridges and Nets. Advances in Petri Nets 90. 483:210-242.
[ICEsSi90b] Esparza, J, Silva M.  1991.  On the Analysis and Synthesis of Free Choice Systems. Advances in Petri Nets 90. 483:243-286.
[RP-89-06] Esparza, J, Silva M.  1989.  Circuits, handles, bridges and nets. :134-153.
[RP-90-02] Esparza, J, Silva M.  1990.  Top-down synthesis of live & bounded Free Choice Nets. :63-83.
[RP-90-07] Esparza, J, Silva M.  1990.  On the analysis and synthesis of free choice nets.
[RP-90-09] Esparza, J, Silva M.  1990.  Modular Synthesis of Free Choice Nets.
[RP-90-10] Esparza, J, Silva M.  1990.  A polynomial-time algorithm to decide liveness of bounded free choice nets.
[RP-91-18] Esparza, J, Silva M.  1991.  On the Analysis and Synthesis of Free Choice Systems. 483:243-286.
[RP-91-29] Esparza, J, Silva M.  1991.  Circuits, handles, bridges and nets. 483:210-242.
[RP-91-30] Esparza, J, Silva M.  1991.  Top-down synthesis of live and bounded free choice nets. 524:118-139.
[RP-91-31] Esparza, J, Silva M.  1991.  Compositional synthesis of live and bounded free-choice nets.
[RP-92-31] Esparza, J, Silva M.  1992.  A polynomial-time algorithm to decide liveness of bounded free choice nets. Theoretical Computer Science. :185-205.
C
[1360] Colom, JM, Esparza J, Martínez J, Silva M.  1990.  A first collection of challenging problems: A Flexible Manufacturing System. Proceedings of Design Methods Based on Nets (DEMON). Esprit Basic Research Action 3148. W.G. 6: Case Studies. Deliverables Covering the Period June 1989 to June 1990.
R
[ICReSiEzTe04] Recalde, L, Silva M, Ezpeleta J, Teruel E.  2004.  Petri nets and manufacturing systems: An examples-driven tour. 3098:742-788.
0 icon
examples_tour.pdf
E
[IPEzRe02] Ezpeleta, J, Recalde L.  2002.  A Deadlock Avoidance Approach for Non Sequential Resource Allocation Systems.
0 icon
02_ER_SMC.pdf
[ICEzCoSi93] Ezpeleta, J, Couvreur JM, Silva M.  1993.  A New Technique for Finding a Generating Family of Siphons, Traps and ST-Components. Application to Coloured Petri Nets. Advances in Petri Nets. 674:126-147.
G
[907] García-Vallés, F, Tricas F, Ezpeleta J, Colom JM.  2000.  Structuraly Safe Net Systems. Discrete Event Systems. Analysis and Control. :441-448.
[908] García-Vallés, F, Tricas F, Ezpeleta J, Colom JM.  1998.  Optimal Control of Discrete Event Systems. International Workshop on Discrete Event Systems, WODES’98. :88-93.
E
[910] Ezpeleta, J, Tricas F, García-Vallés F, Colom JM.  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.
T
[911] Tricas, F, García-Vallés F, Colom JM, Ezpeleta J.  2000.  New Methods for Deadlock Prevention and Avoidance in Concurrent Systems. Actas de las VIII Jornadas de Concurrencia. :97-110.
[912] Tricas, F, García-Vallés F, Colom JM, Ezpeleta J.  2000.  An Iterative Method for Deadlock Prevention in FMS. Discrete Event Systems. Analysis and Control. :139-148.
E
[EzRe-04] Ezpeleta, J, Recalde L.  2004.  A Deadlock Avoidance Approach for Non-Sequential Resource Allocation Systems. IEEE Transactions on Systems, Man and Cybernetics. Part-A: Systems and Humans. 34