Orna Kupferman

Follow

Generating author description...

All published works
Action Title Year Authors
+ PDF Chat Synthesis with Privacy Against an Observer 2024 Orna Kupferman
Ofer Leshkowitz
Namma Shamash Halevy
+ On Semantically-Deterministic Automata 2023 Bader Abu Radi
Orna Kupferman
+ PDF Chat Minimization and Canonization of GFG Transition-Based Automata 2022 Bader Abu Radi
Orna Kupferman
+ PDF Chat Certifying DFA Bounds for Recognition and Separation 2022 Orna Kupferman
Nir Lavee
Salomon Sickert
+ A Hierarchy of Nondeterminism 2022 Bader Abu Radi
Orna Kupferman
Ofer Leshkowitz
+ PDF Chat Certifying Inexpressibility 2021 Salomon Sickert
Orna Kupferman
+ Good-Enough Synthesis 2021 Shaull Almagor
Orna Kupferman
+ PDF Chat Certifying DFA Bounds for Recognition and Separation 2021 Orna Kupferman
Nir Lavee
Salomon Sickert
+ Certifying Inexpressibility 2021 Orna Kupferman
Salomon Sickert
+ Minimization and Canonization of GFG Transition-Based Automata 2021 Bader Abu Radi
Orna Kupferman
+ PDF Chat Canonicity in GFG and Transition-Based Automata 2020 Bader Abu Radi
Orna Kupferman
+ Reasoning about Quality and Fuzziness of Strategic Behaviours 2019 Patricia Bouyer
Orna Kupferman
Nicolas Markey
Bastien Maubert
Aniello Murano
Giuseppe Perelli
+ Reasoning about Quality and Fuzziness of Strategic Behaviours 2019 Patricia Bouyer
Orna Kupferman
Nicolas Markey
Bastien Maubert
Aniello Murano
Giuseppe Perelli
+ Reasoning about Quality and Fuzziness of Strategic Behaviours 2019 Patricia Bouyer
Orna Kupferman
Nicolas Markey
Bastien Maubert
Aniello Murano
Giuseppe Perelli
+ Timed Network Games with Clocks 2018 Guy Avni
Shibashis Guha
Orna Kupferman
+ Timed network games with clocks 2018 Guy Avni
Shibashis Guha
Orna Kupferman
+ Flow Logic 2018 Orna Kupferman
Gal Vardi
+ Timed Network Games with Clocks 2018 Guy Avni
Shibashis Guha
Orna Kupferman
+ Flow Logic 2018 Orna Kupferman
Gal Vardi
+ How Deterministic are Good-For-Games Automata? 2017 Udi Boker
Orna Kupferman
Michał Skrzypczak
+ How Deterministic are Good-For-Games Automata? 2017 Udi Boker
Orna Kupferman
Michał Skrzypczak
+ High-Quality Synthesis Against Stochastic Environments 2016 Shaull Almagor
Orna Kupferman
+ Minimizing Expected Cost Under Hard Boolean Constraints, with Applications to Quantitative Synthesis 2016 Shaull Almagor
Orna Kupferman
Yaron Velner
+ High-Quality Synthesis Against Stochastic Environments 2016 Shaull Almagor
Orna Kupferman
+ Profile trees for Büchi word automata, with application to determinization 2015 Seth Fogarty
Orna Kupferman
Moshe Y. Vardi
Thomas Wilke
+ Discounting in LTL 2014 Shaull Almagor
Udi Boker
Orna Kupferman
+ Discounting in LTL 2014 Shaull Almagor
Udi Boker
Orna Kupferman
+ PDF Chat Profile Trees for Büchi Word Automata, with Application to Determinization 2013 Seth Fogarty
Orna Kupferman
Moshe Y. Vardi
Thomas Wilke
+ PDF Chat Unifying B\"uchi Complementation Constructions 2013 Seth Fogarty
Orna Kupferman
Thomas Wilke
Moshe Y. Vardi
+ Rational Synthesis 2009 Dana Fisman
Orna Kupferman
Yoad Lustig
+ Rational Synthesis 2009 Dana Fisman
Orna Kupferman
Yoad Lustig
+ PDF Chat What causes a system to satisfy a specification? 2008 Hana Chockler
Joseph Y. Halpern
Orna Kupferman
+ What Causes a System to Satisfy a Specification? 2003 Hana Chockler
Joseph Y. Halpern
Orna Kupferman
Common Coauthors
Commonly Cited References
Action Title Year Authors # of times referenced
+ PDF Chat Efficient Separability of Regular Languages by Subsequences and Suffixes 2013 Wojciech Czerwiński
Wim Martens
Tomáš Masopust
4
+ Büchi Complementation Made Tight 2009 Sven Schewe
4
+ Büchi complementation made tight 2009 Sven Schewe
3
+ PDF Chat Explainable Reactive Synthesis 2020 Tom Baumeister
Bernd Finkbeiner
Hazem Torfah
3
+ PDF Chat Certifying Inexpressibility 2021 Salomon Sickert
Orna Kupferman
3
+ PDF Chat Approximate Automata for Omega-Regular Languages 2019 Rayna Dimitrova
Bernd Finkbeiner
Hazem Torfah
2
+ PDF Chat Separating Regular Languages with First-Order Logic 2016 Thomas Place
Marc Zeitoun
2
+ Environment Assumptions for Synthesis 2008 Krishnendu Chatterjee
Thomas A. Henzinger
Barbara Jobstmann
2
+ PDF Chat From Nondeterministic Buchi and Streett Automata to Deterministic Parity Automata 2006 Nir Piterman
2
+ Certifying Inexpressibility 2021 Orna Kupferman
Salomon Sickert
2
+ PDF Chat Quantified CTL: Expressiveness and Complexity 2014 François Laroussinie
Nicolas Markey
2
+ Minimising Good-for-Games automata is NP complete 2020 Sven Schewe
2
+ Regular Separability of Well Structured Transition Systems 2017 Wojciech Czerwiński
Sławomir Lasota
Roland Meyer
Sebastian Muskalla
K. Narayan Kumar
Prakash Saivasan
2
+ PDF Chat State of Büchi Complementation 2011 Ming-Hsien Tsai
Seth Fogarty
Moshe Y. Vardi
Yih-Kuen Tsay
2
+ PDF Chat From Nondeterministic B\"uchi and Streett Automata to Deterministic Parity Automata 2007 Nir Piterman
2
+ PDF Chat Some Complexity Results for Stateful Network Verification 2016 Yaron Velner
Kalev Alpernas
Aurojit Panda
Alexander Rabinovich
Mooly Sagiv
Scott Shenker
Sharon Shoham
1
+ PDF Chat Admissibility in Quantitative Graph Games 2016 Romain Brenguier
Guillermo A. Pérez
Jean-François Raskin
Ocan Sankur
1
+ PDF Chat Strategy logic with imperfect information 2017 Raphaël Berthon
Bastien Maubert
Aniello Murano
Sasha Rubin
Moshe Y. Vardi
1
+ Introduction to Algorithms 1991 V. J. Rayward‐Smith
Thomas H. Cormen
Charles E. Leiserson
Ronald L. Rivest
1
+ PDF Chat Unifying B\"uchi Complementation Constructions 2013 Seth Fogarty
Orna Kupferman
Thomas Wilke
Moshe Y. Vardi
1
+ Reasoning about Quality and Fuzziness of Strategic Behaviours 2019 Patricia Bouyer
Orna Kupferman
Nicolas Markey
Bastien Maubert
Aniello Murano
Giuseppe Perelli
1
+ Energy and Mean-Payoff Parity Markov Decision Processes 2011 Krishnendu Chatterjee
Laurent Doyen
1
+ On Subgame Perfection in Quantitative Reachability Games 2012 Thomas Brihaye
Véronique Bruyère
Julie De Pril
Hugo Gimbert
1
+ Responsibility and blame: a structural-model approach 2003 Hana Chockler
Joseph Y. Halpern
1
+ Multidimensional beyond worst-case and almost-sure problems for mean-payoff objectives 2015 Lorenzo Clemente
Jean-François Raskin
1
+ PDF Chat Timed Parity Games: Complexity and Robustness 2011 Krishnendu Chatterjee
Thomas A. Henzinger
Vinayak S. Prabhu
1
+ Environment Assumptions for Synthesis 2008 Krishnendu Chatterjee
Thomas A. Henzinger
Barbara Jobstmann
1
+ Better Quality in Synthesis through Quantitative Objectives 2009 Roderick Bloem
Krishnendu Chatterjee
Thomas A. Henzinger
Barbara Jobstmann
1
+ Reasoning About Strategies: On the Model-Checking Problem 2011 Fabio Mogavero
Aniello Murano
Giuseppe Perelli
Moshe Y. Vardi
1
+ Causes and Explanations: A Structural-Model Approach 2000 Joseph Y. Halpern
Judea Pearl
1
+ PDF Chat Computing Maximum Flow with Augmenting Electrical Flows 2016 Aleksander Mądry
1
+ Good for Games Automata: From Nondeterminism to Alternation 2019 Udi Boker
Karoliina Lehtinen
1
+ Minimising Good-for-Games automata is NP complete 2020 Sven Schewe
1
+ On the Succinctness of Alternating Parity Good-for-Games Automata 2020 Udi Boker
Denis Kuperberg
Karoliina Lehtinen
Michał Skrzypczak
1
+ Mean-Payoff Games on Timed Automata 2016 Shibashis Guha
Marcin Jurdziński
Shankara Narayanan Krishna
Ashutosh Trivedi
1
+ PDF Chat Canonicity in GFG and Transition-Based Automata 2020 Bader Abu Radi
Orna Kupferman
1
+ PDF Chat Lower Bounds for Complementation of omega-Automata Via the Full Automata Technique 2008 Qiqi Yan
1
+ PDF Chat Certifying DFA Bounds for Recognition and Separation 2022 Orna Kupferman
Nir Lavee
Salomon Sickert
1
+ PDF Chat Multi-valued Verification of Strategic Ability 2020 Wojciech Jamroga
Beata Konikowska
Damian Kurpiewski
Wojciech Penczek
1
+ A Hierarchy of Nondeterminism 2022 Bader Abu Radi
Orna Kupferman
Ofer Leshkowitz
1
+ Admissibility in Quantitative Graph Games 2016 Romain Brenguier
Guillermo A. Pérez
Jean-François Raskin
Ocan Sankur
1
+ PDF Chat Assume-admissible synthesis 2016 Romain Brenguier
Jean-François Raskin
Ocan Sankur
1
+ PDF Chat Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes 2015 Krishnendu Chatterjee
Zuzana Komárková
Jan Křetínský
1
+ PDF Chat Adding Negative Prices to Priced Timed Games 2014 Thomas Brihaye
Gilles Geeraerts
Shankara Narayanan Krishna
Lakshmi Manasa
Benjamin Monmege
Ashutosh Trivedi
1
+ PDF Chat State of B\"uchi Complementation 2014 Ming-Hsien Tsai
Seth Fogarty
Moshe Y. Vardi
Yih-Kuen Tsay
1
+ PDF Chat How to Be Both Rich and Happy: Combining Quantitative and Qualitative Strategic Reasoning about Multi-Player Games (Extended Abstract) 2013 Nils Bulling
Valentin Goranko
1
+ PDF Chat Knowledge and common knowledge in a distributed environment 1990 Joseph Y. Halpern
Yoram Moses
1
+ PDF Chat Reachability in Two-Clock Timed Automata Is PSPACE-Complete 2013 John Fearnley
Marcin Jurdziński
1
+ PDF Chat On Equilibria in Quantitative Games with Reachability/Safety Objectives 2013 Thomas Brihaye
Véronique Bruyère
Julie De Pril
1
+ PDF Chat Causes and explanations in the structural-model approach: Tractable cases 2006 Thomas Eiter
Thomas Lukasiewicz
1