Autor der Publikation

Designing parsimonious scheduling policies for complex resource allocation systems through concurrency theory.

, und . Discrete Event Dynamic Systems, 26 (3): 511-537 (2016)

Bitte wählen Sie eine Person um die Publikation zuzuordnen

Um zwischen Personen mit demselben Namen zu unterscheiden, wird der akademische Grad und der Titel einer wichtigen Publikation angezeigt. Zudem lassen sich über den Button neben dem Namen einige der Person bereits zugeordnete Publikationen anzeigen.

 

Weitere Publikationen von Autoren mit dem selben Namen

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)Algebraic synthesis of efficient deadlock avoidance policies for sequential resource allocation systems., und . IEEE Trans. Robotics Autom., 16 (2): 190-195 (2000)Logical Control of Complex Resource Allocation Systems.. Found. Trends Syst. Control., 4 (1-2): 1-223 (2017)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)Efficient generation of performance bounds for a class of traffic scheduling problems., , und . Discrete Event Dynamic Systems, 29 (2): 211-235 (2019)On the Siphon-Based Characterization of Liveness in Sequential Resource Allocation Systems.. ICATPN, Volume 2679 von Lecture Notes in Computer Science, Seite 241-255. Springer, (2003)Eliminating Concurrency Bugs in Multithreaded Software: A New Approach Based on Discrete-Event Control., , , , , , und . IEEE Trans. Control. Syst. Technol., 21 (6): 2067-2082 (2013)Deadlock avoidance policies for flexible manufacturing systems: the conjunctive case., und . ICRA, Seite 533-538. IEEE, (1996)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, Seite 2113-2118. IEEE, (2005)Gadara nets: Modeling and analyzing lock allocation for deadlock avoidance in multithreaded software., , , , , und . CDC, Seite 4971-4976. IEEE, (2009)