Author of the publication

A polynomial-complexity deadlock avoidance policy for sequential resource allocation systems with multiple resource acquisitions and flexible routings.

, and . CDC, page 2663-2669. IEEE, (2000)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Avoidance versus detection and recovery problem in buffer-space allocation of flexibly automated production systems.. IEEE Trans. Syst. Man Cybern. Part B, 30 (5): 799-811 (2000)Solving the Lagrangian dual problem for some traffic coordination problems through linear programming., , and . CDC, page 5660-5665. IEEE, (2017)Gadara nets: Modeling and analyzing lock allocation for deadlock avoidance in multithreaded software., , , , , and . CDC, page 4971-4976. IEEE, (2009)A linear characterization of the Petri net reachability space corresponding to bounded-length fireable transition sequences and its implications for the structural analysis of process-resource nets with acyclic, quasi-live and strongly reversible process subnets.. CDC/ECC, page 2113-2118. IEEE, (2005)Eliminating Concurrency Bugs in Multithreaded Software: A New Approach Based on Discrete-Event Control., , , , , , and . IEEE Trans. Control. Syst. Technol., 21 (6): 2067-2082 (2013)Deadlock avoidance policies for flexible manufacturing systems: the conjunctive case., and . ICRA, page 533-538. IEEE, (1996)On the Siphon-Based Characterization of Liveness in Sequential Resource Allocation Systems.. ICATPN, volume 2679 of Lecture Notes in Computer Science, page 241-255. Springer, (2003)On the "Counter-Example" in the Article "Max'-Controlled Siphons for Liveness of S3PGR2" Regarding the Results in "Deadlock Avoidance in Sequential Resource Allocation Systems With Multiple Resource Acquisitions and Flexible Routings".. IEEE Trans. Automat. Contr., 61 (1): 194-197 (2016)An Analytical Investigation of the Scheduling Problem for Capacitated Re-Entrant Lines., and . ICRA, page 3193-3198. IEEE, (2002)Designing Reversibility-Enforcing Supervisors of Polynomial Complexity for Bounded Petri Nets Through the Theory of Regions., and . ICATPN, volume 4024 of Lecture Notes in Computer Science, page 322-341. Springer, (2006)