Publications
] Filters: First Letter Of Last Name is C [Clear All Filters]
[259] .
1992. Improving Throughput Upper Bounds for Net Based Models. Robotics and Flexible Manufacturing Systems. :281-294.
[262] .
1991. A Reachable Throughput Upper Bound for Live and Safe Free Choice Nets. 12th International Conference on Application and Theory of Petri Nets. :237-256.
[263] .
1991. Improving Throughput Upper Bounds for Net Based Models. IMACS MCTS’91 International Symposium on Modeling and Control of Technological Systems. 1:573-582.
[269] .
1992. Linear Algebraic Techniques for the Analysis of Petri Nets. Recent Advances in Mathematical Theory of Systems, Control, Networks, and Signal Processing II. :35-42.
[271] .
1990. On liveness analysis through linear algebraic techniques. 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.
[276] .
1990. Performance Evaluation of Repetitive Automated Manufacturing Systems. IEEE Rensselaer's Second International Conference on Computer Integrated Manufacturing. :74-81.
[278] .
1989. Tight Polynomial Bounds for Steady-State Performance of Marked Graphs. Third IEEE International Workshop on Petri Nets and Performance Models (PNPM'89). :200-209.
[337] .
1992. On Weighted T-Systems. Application and Theory of Petri Nets 1992. :348-367.
[365] .
1988. On the Computation of Structural Synchronic Invariants in P/T Nets. Advances in Petri Nets 1988. :386-417.
[672] .
1991. Improving the Linearly Based Characterization of P/T Nets. Advances in Petri Nets 1990. :113-145.
[673] .
1991. 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.
[883] .
1998. Linear Algebraic and Linear Programming Techniques for the Analysis of Place/Transition Net Systems. Lectures on Petri Nets I: Basic Models. Advances in Petri Nets. :309-373.
[907] .
2000. Structuraly Safe Net Systems. Discrete Event Systems. Analysis and Control. :441-448.
[908] .
1998. Optimal Control of Discrete Event Systems. International Workshop on Discrete Event Systems, WODES’98. :88-93.
[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.
[911] .
2000. New Methods for Deadlock Prevention and Avoidance in Concurrent Systems. Actas de las VIII Jornadas de Concurrencia. :97-110.
[912] .
2000. An Iterative Method for Deadlock Prevention in FMS. Discrete Event Systems. Analysis and Control. :139-148.
[915] .
1999. A solution to the problem of deadlocks in concurrent systems using Petri nets and integer linear programming. 11th European Simulation Symposium (ESS’99). Simulation in Industry. :542-546.
[917] .
1998. A Structural Approach to the Problem of Deadlock Prevention in Processes with Resources. International Workshop on Discrete Event Systems, WODES’98. :273-278.
[975] .
1985. Análisis de programas concurrentes mediante Redes de Petri. VI Congreso de Informática y Automática de la AEIA. :519-523.
[995] .
1987. On the structural computation of synchronic invariants in P/T nets. Eighth European Workshop on Application and Theory of Petri Nets. :237-258.
[1001] .
1988. Interrelationships among various concepts of fairness for Petri nets. 31st Midwest Symposium on Circuits and Systems. :1141-1144.
[1005] .
1989. Improving the linearly based characterization of P/T nets. 10th International Conference on Application and Theory of Petri Nets. :52-73.
[1006] .
1989. 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.
