Orna Kupferman

From MaRDI portal
Person:216121

Available identifiers

zbMath Open kupferman.ornaWikidataQ16130473 ScholiaQ16130473MaRDI QIDQ216121

List of research outcomes

PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q60706022023-11-23Paper
Lazy regular sensing2023-08-18Paper
A Hierarchy of Nondeterminism2023-08-08Paper
Reasoning about Quality and Fuzziness of Strategic Behaviors2023-07-18Paper
A space-efficient on-the-fly algorithm for real-time model checking2023-06-28Paper
Minimization of automata for liveness languages2023-06-02Paper
On the complexity of verifying concurrent transition systems2023-05-17Paper
Fair simulation2023-05-17Paper
https://portal.mardi4nfdi.de/entity/Q58741962023-02-07Paper
https://portal.mardi4nfdi.de/entity/Q58753862023-02-03Paper
Lazy regular sensing2023-01-18Paper
Timed network games2023-01-12Paper
Multi-Valued Reasoning about Reactive Systems2023-01-11Paper
On (I/O)-Aware Good-For-Games Automata2022-12-22Paper
https://portal.mardi4nfdi.de/entity/Q51013492022-08-30Paper
Quantitative assume guarantee synthesis2022-08-12Paper
Minimizing GFG Transition-Based Automata2022-07-21Paper
https://portal.mardi4nfdi.de/entity/Q50892192022-07-18Paper
On Repetition Languages2022-07-18Paper
Certifying DFA bounds for recognition and separation2022-06-22Paper
https://portal.mardi4nfdi.de/entity/Q50210132022-01-11Paper
What's decidable about weighted automata?2022-01-06Paper
Verification2021-11-12Paper
Certifying inexpressibility2021-10-18Paper
https://portal.mardi4nfdi.de/entity/Q50051232021-08-04Paper
Spanning-Tree Games.2021-08-04Paper
https://portal.mardi4nfdi.de/entity/Q50028472021-07-28Paper
Mutually accepting capacitated automata2021-07-14Paper
Games with full, longitudinal, and transverse observability2021-07-06Paper
https://portal.mardi4nfdi.de/entity/Q49925102021-06-09Paper
Timed vacuity2021-05-04Paper
Good-enough synthesis2021-02-09Paper
How Deterministic are Good-For-Games Automata?2020-11-25Paper
https://portal.mardi4nfdi.de/entity/Q51363302020-11-25Paper
Hierarchical Network Formation Games2020-08-05Paper
On Synthesis of Specifications with Arithmetic2020-07-20Paper
Properties and Utilization of Capacitated Automata (Invited Talk)2020-07-19Paper
https://portal.mardi4nfdi.de/entity/Q51116212020-05-27Paper
https://portal.mardi4nfdi.de/entity/Q51112512020-05-26Paper
Dynamic resource allocation games2020-01-22Paper
Capacitated automata and systems2019-12-18Paper
Sensing as a Complexity Measure2019-12-10Paper
A Parametrized Analysis of Algorithms on Hierarchical Graphs2019-12-10Paper
https://portal.mardi4nfdi.de/entity/Q49727402019-11-26Paper
Playing with the Maximum-Flow Problem2019-07-04Paper
LTL with Arithmetic and its Applications in Reasoning about Hierarchical Systems2019-07-04Paper
Alternating Reachability Games with Behavioral and Revenue Objectives2019-07-04Paper
https://portal.mardi4nfdi.de/entity/Q46338962019-05-06Paper
Spanning the spectrum from safety to liveness2018-12-12Paper
An abstraction-refinement methodology for reasoning about network games2018-12-10Paper
Formally Reasoning About Quality2018-08-02Paper
Automata Theory and Model Checking2018-07-20Paper
On relative and probabilistic finite counterability2018-04-12Paper
On the Complexity of Universality for Partially Ordered NFAs 2018-03-21Paper
https://portal.mardi4nfdi.de/entity/Q46086602018-03-21Paper
Synthesis from component libraries with costs2018-02-09Paper
Latticed-LTL synthesis in the presence of noisy inputs2017-11-10Paper
https://portal.mardi4nfdi.de/entity/Q53577132017-09-12Paper
Sensing as a complexity measure2017-08-31Paper
A parametrized analysis of algorithms on hierarchical graphs2017-08-31Paper
https://portal.mardi4nfdi.de/entity/Q53519572017-08-31Paper
High-Quality Synthesis Against Stochastic Environments2017-07-19Paper
https://portal.mardi4nfdi.de/entity/Q52753802017-07-13Paper
https://portal.mardi4nfdi.de/entity/Q52753812017-07-13Paper
From linear time to branching time2017-07-12Paper
What causes a system to satisfy a specification?2017-07-12Paper
https://portal.mardi4nfdi.de/entity/Q29785102017-04-25Paper
Network-formation games with regular objectives2016-11-18Paper
Dynamic Resource Allocation Games2016-09-29Paper
Synthesis with rational environments2016-09-16Paper
On High-Quality Synthesis2016-07-25Paper
On the Capacity of Capacitated Automata2016-04-13Paper
https://portal.mardi4nfdi.de/entity/Q34594752016-01-08Paper
Spanning the Spectrum from Safety to Liveness2016-01-08Paper
A Game-Theoretic Approach to Simulation of Data-Parameterized Systems2015-12-17Paper
Profile trees for Büchi word automata, with application to determinization2015-12-07Paper
Alternating-time temporal logic2015-12-07Paper
Inherent Vacuity in Lattice Automata2015-09-22Paper
Erratum for “What causes a system to satisfy a specification?”2015-09-17Paper
Translating to Co-Büchi Made Tight, Unified, and Useful2015-09-17Paper
Temporal Specifications with Accumulative Values2015-09-17Paper
Parameterized Weighted Containment2015-09-17Paper
Minimizing Deterministic Lattice Automata2015-09-17Paper
Stochastization of Weighted Automata2015-09-16Paper
Discounting in LTL2015-02-10Paper
Prime languages2015-01-30Paper
Reasoning about online algorithms with weighted automata2014-11-18Paper
From Reachability to Temporal Specifications in Cost-Sharing Games2014-09-26Paper
Synthesis from Component Libraries with Costs2014-09-15Paper
Weighted Safety2014-07-08Paper
A Framework for Ranking Vacuity Results2014-07-08Paper
An Automata-Theoretic Approach to Reasoning about Parameterized Systems and Specifications2014-07-08Paper
An abstraction-refinement framework for trigger querying2014-06-30Paper
Network-Formation Games with Regular Objectives2014-04-16Paper
Latticed-LTL Synthesis in the Presence of Noisy Inputs2014-04-16Paper
When does abstraction help?2014-04-14Paper
Rigorous approximated determinization of weighted automata2013-11-29Paper
Prime Languages2013-09-20Paper
Formalizing and Reasoning about Quality2013-08-07Paper
Nondeterminism in the Presence of a Diverse or Unknown Future2013-08-07Paper
Verification of Open Systems2013-06-18Paper
Branching-Depth Hierarchies2013-04-26Paper
Unifying B\"uchi Complementation Constructions2013-04-09Paper
Parameterized Weighted Containment2013-03-18Paper
Approximating Deterministic Lattice Automata2012-11-21Paper
Model Checking Systems and Specifications with Parameterized Atomic Propositions2012-11-21Paper
Making Weighted Containment Feasible: A Heuristic Based on Simulation and Abstraction2012-09-25Paper
Unifying Büchi Complementation Constructions.2012-09-18Paper
https://portal.mardi4nfdi.de/entity/Q29088722012-08-29Paper
\textit{Once} and \textit{for all}2012-08-17Paper
Coping with selfish on-going behaviors2012-05-24Paper
Improved model checking of hierarchical systems2012-05-24Paper
https://portal.mardi4nfdi.de/entity/Q31137242012-01-23Paper
Max and Sum Semantics for Alternating Weighted Automata2011-10-07Paper
Formal Analysis of Online Algorithms2011-10-07Paper
What’s Decidable about Weighted Automata?2011-10-07Paper
Co-Büching Them All2011-05-19Paper
Minimizing Deterministic Lattice Automata2011-05-19Paper
On Bounded Specifications2011-05-06Paper
Synthesis of Trigger Properties2011-01-07Paper
Coping with Selfish On-Going Behaviors2011-01-07Paper
https://portal.mardi4nfdi.de/entity/Q30609822010-12-13Paper
Promptness in ω-Regular Automata2010-10-04Paper
An Automata-Theoretic Approach to Infinite-State Systems2010-09-07Paper
Alternation Removal in Büchi Automata2010-09-07Paper
The Quest for a Tight Translation of Büchi to co-Büchi Automata2010-09-03Paper
Variable Automata over Infinite Alphabets2010-05-26Paper
Rational Synthesis2010-04-27Paper
LATTICED SIMULATION RELATIONS AND GAMES2010-04-22Paper
Verification: Theory and Practice2010-03-23Paper
Correct Hardware Design and Verification Methods2010-02-05Paper
Correct Hardware Design and Verification Methods2010-02-05Paper
Improved Model Checking of Hierarchical Systems2010-01-14Paper
From liveness to promptness2009-11-23Paper
https://portal.mardi4nfdi.de/entity/Q33966142009-09-19Paper
Lower Bounds on Witnesses for Nonemptiness of Universal Co-Büchi Automata2009-03-31Paper
Tightening the Exchange Rates Between Automata2009-03-05Paper
On the Relative Succinctness of Nondeterministic Büchi and co-Büchi Word Automata2009-01-27Paper
Weak alternating automata are not that weak2008-12-21Paper
On the Construction of Fine Automata for Safety Properties2008-09-04Paper
On the Succinctness of Nondeterminism2008-09-04Paper
Latticed Simulation Relations and Games2008-07-03Paper
On Locally Checkable Properties2008-05-27Paper
An automata-theoretic approach to branching-time model checking2008-05-05Paper
Vacuity in Testing2008-04-24Paper
On Verifying Fault Tolerance of Distributed Protocols2008-04-11Paper
Lattice Automata2008-04-04Paper
Better Under-Approximation of Programs by Hiding Variables2008-04-04Paper
https://portal.mardi4nfdi.de/entity/Q54473662008-03-06Paper
Concurrent reachability games2007-12-19Paper
From Liveness to Promptness2007-11-29Paper
Leaping Loops in the Presence of Abstraction2007-11-29Paper
STACS 20042007-10-01Paper
Tools and Algorithms for the Construction and Analysis of Systems2007-09-28Paper
Safraless Compositional Synthesis2007-09-05Paper
Finding Shortest Witnesses to the Nonemptiness of Automata on Infinite Words2007-09-04Paper
Sanity Checks in Formal Verification2007-09-04Paper
Coverage metrics for temporal logic model checking2006-11-17Paper
Automated Technology for Verification and Analysis2006-10-25Paper
Automated Technology for Verification and Analysis2006-10-25Paper
Correct Hardware Design and Verification Methods2006-10-20Paper
Correct Hardware Design and Verification Methods2006-10-20Paper
BÜCHI COMPLEMENTATION MADE TIGHTER2006-08-21Paper
TYPENESS FOR ω-REGULAR AUTOMATA2006-08-21Paper
On the universal and existential fragments of the \(\mu\)-calculus2006-04-28Paper
Computer Aided Verification2006-01-10Paper
Relating word and tree automata2005-12-29Paper
From complementation to certification2005-12-06Paper
Tools and Algorithms for the Construction and Analysis of Systems2005-11-10Paper
Logic for Programming, Artificial Intelligence, and Reasoning2005-11-10Paper
https://portal.mardi4nfdi.de/entity/Q56922802005-09-28Paper
\(\omega\)-regular languages are testable with a constant number of queries2005-02-09Paper
https://portal.mardi4nfdi.de/entity/Q48175422004-09-24Paper
From pre-historic to post-modern symbolic model checking2004-09-09Paper
https://portal.mardi4nfdi.de/entity/Q48090762004-08-12Paper
https://portal.mardi4nfdi.de/entity/Q47371962004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q44724412004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44492132004-02-08Paper
https://portal.mardi4nfdi.de/entity/Q44404252003-12-17Paper
https://portal.mardi4nfdi.de/entity/Q44283052003-09-15Paper
https://portal.mardi4nfdi.de/entity/Q44179132003-07-30Paper
https://portal.mardi4nfdi.de/entity/Q44179142003-07-30Paper
https://portal.mardi4nfdi.de/entity/Q44118302003-07-10Paper
https://portal.mardi4nfdi.de/entity/Q47085942003-06-18Paper
https://portal.mardi4nfdi.de/entity/Q48049102003-05-01Paper
https://portal.mardi4nfdi.de/entity/Q45425922003-02-19Paper
https://portal.mardi4nfdi.de/entity/Q47918532003-02-03Paper
Module checking2003-01-14Paper
Fair simulation2003-01-14Paper
On the complexity of verifying concurrent transition systems2003-01-14Paper
https://portal.mardi4nfdi.de/entity/Q45365962002-11-28Paper
https://portal.mardi4nfdi.de/entity/Q45363852002-11-04Paper
https://portal.mardi4nfdi.de/entity/Q45511352002-09-04Paper
Model checking of safety properties2002-04-04Paper
https://portal.mardi4nfdi.de/entity/Q27694352002-02-05Paper
https://portal.mardi4nfdi.de/entity/Q27696122002-02-05Paper
https://portal.mardi4nfdi.de/entity/Q27540722001-11-11Paper
https://portal.mardi4nfdi.de/entity/Q44943882001-05-28Paper
https://portal.mardi4nfdi.de/entity/Q45184252000-11-28Paper
https://portal.mardi4nfdi.de/entity/Q49523072000-05-09Paper
https://portal.mardi4nfdi.de/entity/Q49361492000-01-25Paper
https://portal.mardi4nfdi.de/entity/Q42700711999-12-20Paper
https://portal.mardi4nfdi.de/entity/Q42510631999-11-16Paper
Church's Problem Revisited1999-09-22Paper
https://portal.mardi4nfdi.de/entity/Q42599921999-09-08Paper
Augmenting branching temporal logics with existential quantification over atomic propositions1999-06-20Paper
https://portal.mardi4nfdi.de/entity/Q42189401999-03-30Paper
https://portal.mardi4nfdi.de/entity/Q43564341997-11-26Paper
Branching-time temporal logic and tree automata1996-12-12Paper
Buy one, get one free!!!1996-11-17Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Orna Kupferman