Published in: LIPIcs, Volume 279, 34th International Conference on Concurrency Theory (CONCUR 2023)
Orna Kupferman and Noam Shenwald. Games with Trading of Control. In 34th International Conference on Concurrency Theory (CONCUR 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 279, pp. 19:1-19:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{kupferman_et_al:LIPIcs.CONCUR.2023.19, author = {Kupferman, Orna and Shenwald, Noam}, title = {{Games with Trading of Control}}, booktitle = {34th International Conference on Concurrency Theory (CONCUR 2023)}, pages = {19:1--19:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-299-0}, ISSN = {1868-8969}, year = {2023}, volume = {279}, editor = {P\'{e}rez, Guillermo A. and Raskin, Jean-Fran\c{c}ois}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2023.19}, URN = {urn:nbn:de:0030-drops-190137}, doi = {10.4230/LIPIcs.CONCUR.2023.19}, annote = {Keywords: Parity Games, Rational Synthesis, Game Theory, Auctions} }
Published in: LIPIcs, Volume 261, 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)
Bader Abu Radi and Orna Kupferman. On Semantically-Deterministic Automata. In 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 261, pp. 109:1-109:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{aburadi_et_al:LIPIcs.ICALP.2023.109, author = {Abu Radi, Bader and Kupferman, Orna}, title = {{On Semantically-Deterministic Automata}}, booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)}, pages = {109:1--109:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-278-5}, ISSN = {1868-8969}, year = {2023}, volume = {261}, editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.109}, URN = {urn:nbn:de:0030-drops-181610}, doi = {10.4230/LIPIcs.ICALP.2023.109}, annote = {Keywords: Automata on infinite words, Nondeterminism, Succinctness, Decision procedures} }
Published in: LIPIcs, Volume 250, 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022)
Orna Kupferman and Ofer Leshkowitz. Synthesis of Privacy-Preserving Systems. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 250, pp. 42:1-42:23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{kupferman_et_al:LIPIcs.FSTTCS.2022.42, author = {Kupferman, Orna and Leshkowitz, Ofer}, title = {{Synthesis of Privacy-Preserving Systems}}, booktitle = {42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022)}, pages = {42:1--42:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-261-7}, ISSN = {1868-8969}, year = {2022}, volume = {250}, editor = {Dawar, Anuj and Guruswami, Venkatesan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2022.42}, URN = {urn:nbn:de:0030-drops-174342}, doi = {10.4230/LIPIcs.FSTTCS.2022.42}, annote = {Keywords: Synthesis, Privacy, LTL, Games} }
Published in: LIPIcs, Volume 243, 33rd International Conference on Concurrency Theory (CONCUR 2022)
Ilaria Castellani, Paul Gastin, Orna Kupferman, Mickael Randour, and Davide Sangiorgi. CONCUR Test-Of-Time Award 2022 (Invited Paper). In 33rd International Conference on Concurrency Theory (CONCUR 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 243, pp. 1:1-1:3, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{castellani_et_al:LIPIcs.CONCUR.2022.1, author = {Castellani, Ilaria and Gastin, Paul and Kupferman, Orna and Randour, Mickael and Sangiorgi, Davide}, title = {{CONCUR Test-Of-Time Award 2022}}, booktitle = {33rd International Conference on Concurrency Theory (CONCUR 2022)}, pages = {1:1--1:3}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-246-4}, ISSN = {1868-8969}, year = {2022}, volume = {243}, editor = {Klin, Bartek and Lasota, S{\l}awomir 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.CONCUR.2022.1}, URN = {urn:nbn:de:0030-drops-170644}, doi = {10.4230/LIPIcs.CONCUR.2022.1}, annote = {Keywords: CONCUR Test-of-Time Award} }
Published in: LIPIcs, Volume 243, 33rd International Conference on Concurrency Theory (CONCUR 2022)
Orna Kupferman and Naama Shamash Halevy. Energy Games with Resource-Bounded Environments. In 33rd International Conference on Concurrency Theory (CONCUR 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 243, pp. 19:1-19:23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{kupferman_et_al:LIPIcs.CONCUR.2022.19, author = {Kupferman, Orna and Shamash Halevy, Naama}, title = {{Energy Games with Resource-Bounded Environments}}, booktitle = {33rd International Conference on Concurrency Theory (CONCUR 2022)}, pages = {19:1--19:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-246-4}, ISSN = {1868-8969}, year = {2022}, volume = {243}, editor = {Klin, Bartek and Lasota, S{\l}awomir 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.CONCUR.2022.19}, URN = {urn:nbn:de:0030-drops-170823}, doi = {10.4230/LIPIcs.CONCUR.2022.19}, annote = {Keywords: Energy Games, Infinite-State Systems, Decidability} }
Published in: LIPIcs, Volume 216, 30th EACSL Annual Conference on Computer Science Logic (CSL 2022)
Antonio Casares. On the Minimisation of Transition-Based Rabin Automata and the Chromatic Memory Requirements of Muller Conditions. In 30th EACSL Annual Conference on Computer Science Logic (CSL 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 216, pp. 12:1-12:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{casares:LIPIcs.CSL.2022.12, author = {Casares, Antonio}, title = {{On the Minimisation of Transition-Based Rabin Automata and the Chromatic Memory Requirements of Muller Conditions}}, booktitle = {30th EACSL Annual Conference on Computer Science Logic (CSL 2022)}, pages = {12:1--12:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-218-1}, ISSN = {1868-8969}, year = {2022}, volume = {216}, editor = {Manea, Florin and Simpson, Alex}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2022.12}, URN = {urn:nbn:de:0030-drops-157322}, doi = {10.4230/LIPIcs.CSL.2022.12}, annote = {Keywords: Automata on Infinite Words, Games on Graphs, Arena-Independent Memory, Complexity} }
Published in: LIPIcs, Volume 202, 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)
Bader Abu Radi, Orna Kupferman, and Ofer Leshkowitz. A Hierarchy of Nondeterminism. In 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 202, pp. 85:1-85:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{aburadi_et_al:LIPIcs.MFCS.2021.85, author = {Abu Radi, Bader and Kupferman, Orna and Leshkowitz, Ofer}, title = {{A Hierarchy of Nondeterminism}}, booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)}, pages = {85:1--85:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-201-3}, ISSN = {1868-8969}, year = {2021}, volume = {202}, editor = {Bonchi, Filippo and Puglisi, Simon J.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.85}, URN = {urn:nbn:de:0030-drops-145254}, doi = {10.4230/LIPIcs.MFCS.2021.85}, annote = {Keywords: Automata on Infinite Words, Expressive power, Complexity, Games} }
Published in: LIPIcs, Volume 182, 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020)
Orna Kupferman and Noam Shenwald. Perspective Games with Notifications. In 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 182, pp. 51:1-51:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{kupferman_et_al:LIPIcs.FSTTCS.2020.51, author = {Kupferman, Orna and Shenwald, Noam}, title = {{Perspective Games with Notifications}}, booktitle = {40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020)}, pages = {51:1--51:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-174-0}, ISSN = {1868-8969}, year = {2020}, volume = {182}, editor = {Saxena, Nitin and Simon, Sunil}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2020.51}, URN = {urn:nbn:de:0030-drops-132928}, doi = {10.4230/LIPIcs.FSTTCS.2020.51}, annote = {Keywords: Games, Incomplete Information, Automata} }
Published in: LIPIcs, Volume 170, 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)
Ismaël Jecker, Orna Kupferman, and Nicolas Mazzocchi. Unary Prime Languages. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 51:1-51:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{jecker_et_al:LIPIcs.MFCS.2020.51, author = {Jecker, Isma\"{e}l and Kupferman, Orna and Mazzocchi, Nicolas}, title = {{Unary Prime Languages}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {51:1--51:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.51}, URN = {urn:nbn:de:0030-drops-127177}, doi = {10.4230/LIPIcs.MFCS.2020.51}, annote = {Keywords: Deterministic Finite Automata (DFA), Regular Languages, Primality} }
Published in: LIPIcs, Volume 170, 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)
Orna Kupferman and Ofer Leshkowitz. On Repetition Languages. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 59:1-59:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{kupferman_et_al:LIPIcs.MFCS.2020.59, author = {Kupferman, Orna and Leshkowitz, Ofer}, title = {{On Repetition Languages}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {59:1--59:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.59}, URN = {urn:nbn:de:0030-drops-127268}, doi = {10.4230/LIPIcs.MFCS.2020.59}, annote = {Keywords: B\"{u}chi automata, Expressive power, Succinctness} }
Published in: LIPIcs, Volume 152, 28th EACSL Annual Conference on Computer Science Logic (CSL 2020)
Gili Bielous and Orna Kupferman. Coverage and Vacuity in Network Formation Games. In 28th EACSL Annual Conference on Computer Science Logic (CSL 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 152, pp. 10:1-10:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{bielous_et_al:LIPIcs.CSL.2020.10, author = {Bielous, Gili and Kupferman, Orna}, title = {{Coverage and Vacuity in Network Formation Games}}, booktitle = {28th EACSL Annual Conference on Computer Science Logic (CSL 2020)}, pages = {10:1--10:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-132-0}, ISSN = {1868-8969}, year = {2020}, volume = {152}, editor = {Fern\'{a}ndez, Maribel 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.CSL.2020.10}, URN = {urn:nbn:de:0030-drops-116532}, doi = {10.4230/LIPIcs.CSL.2020.10}, annote = {Keywords: Network Formation Games, Vacuity, Coverage} }
Published in: LIPIcs, Volume 140, 30th International Conference on Concurrency Theory (CONCUR 2019)
Udi Boker and Karoliina Lehtinen. Good for Games Automata: From Nondeterminism to Alternation. In 30th International Conference on Concurrency Theory (CONCUR 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 140, pp. 19:1-19:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
@InProceedings{boker_et_al:LIPIcs.CONCUR.2019.19, author = {Boker, Udi and Lehtinen, Karoliina}, title = {{Good for Games Automata: From Nondeterminism to Alternation}}, booktitle = {30th International Conference on Concurrency Theory (CONCUR 2019)}, pages = {19:1--19:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-121-4}, ISSN = {1868-8969}, year = {2019}, volume = {140}, editor = {Fokkink, Wan and van Glabbeek, Rob}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2019.19}, URN = {urn:nbn:de:0030-drops-109212}, doi = {10.4230/LIPIcs.CONCUR.2019.19}, annote = {Keywords: Good for games, history-determinism, alternation} }
Published in: LIPIcs, Volume 140, 30th International Conference on Concurrency Theory (CONCUR 2019)
Ayrat Khalimov and Orna Kupferman. Register-Bounded Synthesis. In 30th International Conference on Concurrency Theory (CONCUR 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 140, pp. 25:1-25:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
@InProceedings{khalimov_et_al:LIPIcs.CONCUR.2019.25, author = {Khalimov, Ayrat and Kupferman, Orna}, title = {{Register-Bounded Synthesis}}, booktitle = {30th International Conference on Concurrency Theory (CONCUR 2019)}, pages = {25:1--25:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-121-4}, ISSN = {1868-8969}, year = {2019}, volume = {140}, editor = {Fokkink, Wan and van Glabbeek, Rob}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2019.25}, URN = {urn:nbn:de:0030-drops-109277}, doi = {10.4230/LIPIcs.CONCUR.2019.25}, annote = {Keywords: Synthesis, Register Automata, Register Transducers} }
Published in: LIPIcs, Volume 132, 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)
Bader Abu Radi and Orna Kupferman. Minimizing GFG Transition-Based Automata (Track B: Automata, Logic, Semantics, and Theory of Programming). In 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 132, pp. 100:1-100:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
@InProceedings{aburadi_et_al:LIPIcs.ICALP.2019.100, author = {Abu Radi, Bader and Kupferman, Orna}, title = {{Minimizing GFG Transition-Based Automata}}, booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)}, pages = {100:1--100:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-109-2}, ISSN = {1868-8969}, year = {2019}, volume = {132}, editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.100}, URN = {urn:nbn:de:0030-drops-106761}, doi = {10.4230/LIPIcs.ICALP.2019.100}, annote = {Keywords: Minimization, Deterministic co-B\"{u}chi Automata} }
Published in: LIPIcs, Volume 117, 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)
Guy Avni, Shibashis Guha, and Orna Kupferman. Timed Network Games with Clocks. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 23:1-23:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{avni_et_al:LIPIcs.MFCS.2018.23, author = {Avni, Guy and Guha, Shibashis and Kupferman, Orna}, title = {{Timed Network Games with Clocks}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {23:1--23:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.23}, URN = {urn:nbn:de:0030-drops-96053}, doi = {10.4230/LIPIcs.MFCS.2018.23}, annote = {Keywords: Network games, Timed automata, Nash equilibrium, Equilibrium inefficiency} }
Feedback for Dagstuhl Publishing