Published in: LIPIcs, Volume 229, 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022)
Hugo Gimbert, Corto Mascle, Anca Muscholl, and Igor Walukiewicz. Distributed Controller Synthesis for Deadlock Avoidance. In 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 229, pp. 125:1-125:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{gimbert_et_al:LIPIcs.ICALP.2022.125, author = {Gimbert, Hugo and Mascle, Corto and Muscholl, Anca and Walukiewicz, Igor}, title = {{Distributed Controller Synthesis for Deadlock Avoidance}}, booktitle = {49th International Colloquium on Automata, Languages, and Programming (ICALP 2022)}, pages = {125:1--125:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-235-8}, ISSN = {1868-8969}, year = {2022}, volume = {229}, editor = {Boja\'{n}czyk, Miko{\l}aj and Merelli, Emanuela and Woodruff, David P.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2022.125}, URN = {urn:nbn:de:0030-drops-164668}, doi = {10.4230/LIPIcs.ICALP.2022.125}, annote = {Keywords: Distributed Synthesis, Concurrency, Lock Synchronisation, Deadlock Avoidance} }
Published in: LIPIcs, Volume 171, 31st International Conference on Concurrency Theory (CONCUR 2020)
Patricia Bouyer, Stéphane Le Roux, Youssouf Oualhadj, Mickael Randour, and Pierre Vandenhove. Games Where You Can Play Optimally with Arena-Independent Finite Memory. In 31st International Conference on Concurrency Theory (CONCUR 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 171, pp. 24:1-24:22, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{bouyer_et_al:LIPIcs.CONCUR.2020.24, author = {Bouyer, Patricia and Le Roux, St\'{e}phane and Oualhadj, Youssouf and Randour, Mickael and Vandenhove, Pierre}, title = {{Games Where You Can Play Optimally with Arena-Independent Finite Memory}}, booktitle = {31st International Conference on Concurrency Theory (CONCUR 2020)}, pages = {24:1--24:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-160-3}, ISSN = {1868-8969}, year = {2020}, volume = {171}, editor = {Konnov, Igor and Kov\'{a}cs, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020.24}, URN = {urn:nbn:de:0030-drops-128360}, doi = {10.4230/LIPIcs.CONCUR.2020.24}, annote = {Keywords: two-player games on graphs, finite-memory determinacy, optimal strategies} }
Published in: LIPIcs, Volume 118, 29th International Conference on Concurrency Theory (CONCUR 2018)
Paulin Fournier and Hugo Gimbert. Alternating Nonzero Automata. In 29th International Conference on Concurrency Theory (CONCUR 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 118, pp. 13:1-13:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{fournier_et_al:LIPIcs.CONCUR.2018.13, author = {Fournier, Paulin and Gimbert, Hugo}, title = {{Alternating Nonzero Automata}}, booktitle = {29th International Conference on Concurrency Theory (CONCUR 2018)}, pages = {13:1--13:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-087-3}, ISSN = {1868-8969}, year = {2018}, volume = {118}, editor = {Schewe, Sven and Zhang, Lijun}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2018.13}, URN = {urn:nbn:de:0030-drops-95517}, doi = {10.4230/LIPIcs.CONCUR.2018.13}, annote = {Keywords: zero-automata, probabilities, temporal logics} }
Published in: LIPIcs, Volume 93, 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017)
Hugo Gimbert. On the Control of Asynchronous Automata. In 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 93, pp. 30:1-30:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{gimbert:LIPIcs.FSTTCS.2017.30, author = {Gimbert, Hugo}, title = {{On the Control of Asynchronous Automata}}, booktitle = {37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017)}, pages = {30:1--30:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-055-2}, ISSN = {1868-8969}, year = {2018}, volume = {93}, editor = {Lokam, Satya and Ramanujam, R.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2017.30}, URN = {urn:nbn:de:0030-drops-84142}, doi = {10.4230/LIPIcs.FSTTCS.2017.30}, annote = {Keywords: Asynchronous automata, Controller synthesis} }
Published in: LIPIcs, Volume 85, 28th International Conference on Concurrency Theory (CONCUR 2017)
Nathalie Bertrand, Miheer Dewaskar, Blaise Genest, and Hugo Gimbert. Controlling a Population. In 28th International Conference on Concurrency Theory (CONCUR 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 85, pp. 12:1-12:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{bertrand_et_al:LIPIcs.CONCUR.2017.12, author = {Bertrand, Nathalie and Dewaskar, Miheer and Genest, Blaise and Gimbert, Hugo}, title = {{Controlling a Population}}, booktitle = {28th International Conference on Concurrency Theory (CONCUR 2017)}, pages = {12:1--12:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-048-4}, ISSN = {1868-8969}, year = {2017}, volume = {85}, editor = {Meyer, Roland and Nestmann, Uwe}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2017.12}, URN = {urn:nbn:de:0030-drops-78000}, doi = {10.4230/LIPIcs.CONCUR.2017.12}, annote = {Keywords: Model-checking, control, parametric systems} }
Published in: LIPIcs, Volume 80, 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)
Mikolaj Bojanczyk, Hugo Gimbert, and Edon Kelmendi. Emptiness of Zero Automata Is Decidable. In 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 80, pp. 106:1-106:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{bojanczyk_et_al:LIPIcs.ICALP.2017.106, author = {Bojanczyk, Mikolaj and Gimbert, Hugo and Kelmendi, Edon}, title = {{Emptiness of Zero Automata Is Decidable}}, booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)}, pages = {106:1--106:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-041-5}, ISSN = {1868-8969}, year = {2017}, volume = {80}, editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.106}, URN = {urn:nbn:de:0030-drops-74745}, doi = {10.4230/LIPIcs.ICALP.2017.106}, annote = {Keywords: tree automata, probabilistic automata, monadic second-order logic} }
Feedback for Dagstuhl Publishing