Author of the publication

Synthesizing time-triggered schedules for switched networks with faulty links.

, , and . EMSOFT, page 26:1-26:10. ACM, (2016)

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

Synthesis from component libraries with costs., and . Theor. Comput. Sci., (2018)Dynamic resource allocation games., , and . Theor. Comput. Sci., (2020)Congestion Games with Multisets of Resources and Applications in Synthesis., , and . FSTTCS, volume 45 of LIPIcs, page 365-379. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Synthesis from Component Libraries with Costs., and . CONCUR, volume 8704 of Lecture Notes in Computer Science, page 156-172. Springer, (2014)Infinite-Duration Poorman-Bidding Games., , and . WINE, volume 11316 of Lecture Notes in Computer Science, page 21-36. Springer, (2018)Run-Time Optimization for Learned Controllers Through Quantitative Games., , , , , and . CAV (1), volume 11561 of Lecture Notes in Computer Science, page 630-649. Springer, (2019)Cost-sharing scheduling games on restricted unrelated machines., and . Theor. Comput. Sci., (2016)Dimension-Minimality and Primality of Counter Nets., , , and . CoRR, (2023)Reachability Poorman Discrete-Bidding Games., , , , and . CoRR, (2023)Quantitative Formal Methods Meets Algorithmic Game Theory (שער נוסף בעברית: שיטות פורמליות כמותיות פוגשות את תורת המשחקים החישובית.).. Hebrew University of Jerusalem, Israel, (2016)