Zobrazeno 1 - 10
of 292
pro vyhledávání: '"Kupferman, Orna"'
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 via sets $I$ and $O$ of input and output signals. The input to the synth
Externí odkaz:
http://arxiv.org/abs/2411.08635
Autor:
Radi, Bader Abu, Kupferman, Orna
A nondeterministic automaton is semantically deterministic (SD) if different nondeterministic choices in the automaton lead to equivalent states. Semantic determinism is interesting as it is a natural relaxation of determinism, and as some applicatio
Externí odkaz:
http://arxiv.org/abs/2305.15489
We study three levels in a hierarchy of nondeterminism: A nondeterministic automaton $\mathcal{A}$ is determinizable by pruning (DBP) if we can obtain a deterministic automaton equivalent to $\mathcal{A}$ by removing some of its transitions. Then, $\
Externí odkaz:
http://arxiv.org/abs/2209.09866
Autor:
Almagor, Shaull, Kupferman, Orna
Publikováno v:
Computer Aided Verification - 32nd International Conference (2020), 541--563
In the classical synthesis problem, we are given an LTL formula \psi over sets of input and output signals, and we synthesize a system T that realizes \psi: with every input sequences x, the system associates an output sequence T(x) such that the gen
Externí odkaz:
http://arxiv.org/abs/2109.03594
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 generate certificates for the number of states that a deterministic finite a
Externí odkaz:
http://arxiv.org/abs/2107.01566
Autor:
Radi, Bader Abu, Kupferman, Orna
Publikováno v:
Logical Methods in Computer Science, Volume 18, Issue 3 (August 2, 2022) lmcs:7587
While many applications of automata in formal methods can use nondeterministic automata, some applications, most notably synthesis, need deterministic or good-for-games (GFG) automata. The latter are nondeterministic automata that can resolve their n
Externí odkaz:
http://arxiv.org/abs/2106.06745
Autor:
Kupferman, Orna, Sickert, Salomon
Different classes of automata on infinite words have different expressive power. Deciding whether a given language $L \subseteq \Sigma^\omega$ can be expressed by an automaton of a desired class can be reduced to deciding a game between Prover and Re
Externí odkaz:
http://arxiv.org/abs/2101.08756
Autor:
Radi, Bader Abu, Kupferman, Orna
Publikováno v:
EPTCS 326, 2020, pp. 199-215
Minimization of deterministic automata on finite words results in a {\em canonical\/} automaton. For deterministic automata on infinite words, no canonical minimal automaton exists, and a language may have different minimal deterministic B\"uchi (DBW
Externí odkaz:
http://arxiv.org/abs/2009.10885
Autor:
Kupferman, Orna, Petruschka, Asaf
Publikováno v:
In Theoretical Computer Science 6 September 2023 971
