28 citations · 62 across the 13 of their papers we have counts for
19 papers
Synthesis with Privacy Against an Observer
Orna Kupferman, Ofer Leshkowitz, Namma Shamash Halevy
We study automatic synthesis of systems that interact with their environment and maintain privacy against an observer to the interaction. The system and the environment interact vi…
On Semantically-Deterministic Automata
Bader Abu Radi, Orna Kupferman
A nondeterministic automaton is semantically deterministic (SD) if different nondeterministic choices in the automaton lead to equivalent states. Semantic determinism is interestin…
A Hierarchy of Nondeterminism
Bader Abu Radi, Orna Kupferman, Ofer Leshkowitz
We study three levels in a hierarchy of nondeterminism: A nondeterministic automaton is determinizable by pruning (DBP) if we can obtain a deterministic automaton equ…
Good-Enough Synthesis
Shaull Almagor, Orna Kupferman
In the classical synthesis problem, we are given an LTL formula ψover sets of input and output signals, and we synthesize a system T that realizes ψ: with every input sequences x,…
Certifying DFA Bounds for Recognition and Separation
Orna Kupferman, Nir Lavee, Salomon Sickert
The automation of decision procedures makes certification essential. We suggest to use determinacy of turn-based two-player games with regular winning conditions in order to genera…
Minimization and Canonization of GFG Transition-Based Automata
Bader Abu Radi, Orna Kupferman
While many applications of automata in formal methods can use nondeterministic automata, some applications, most notably synthesis, need deterministic or good-for-games (GFG) autom…