Using the past for resolving the future
O Kupferman - Frontiers in Computer Science, 2023 - frontiersin.org
Nondeterminism models an ability to see the future: An automaton with an infinite look
ahead can successfully resolve its nondeterministic choices. An automaton is history …
ahead can successfully resolve its nondeterministic choices. An automaton is history …
Büchi good-for-games automata are efficiently recognizable
M Bagnol, D Kuperberg - … IARCS Annual Conference on Foundations of …, 2018 - hal.science
Good-for-Games (GFG) automata offer a compromise between deterministic and
nondetermin-istic automata. They can resolve nondeterministic choices in a step-by-step …
nondetermin-istic automata. They can resolve nondeterministic choices in a step-by-step …
A hierarchy of nondeterminism
B Abu Radi, O Kupferman… - … Foundations of Computer …, 2021 - drops.dagstuhl.de
We study three levels in a hierarchy of nondeterminism: A nondeterministic automaton A is
determinizable by pruning (DBP) if we can obtain a deterministic automaton equivalent to A …
determinizable by pruning (DBP) if we can obtain a deterministic automaton equivalent to A …
[PDF][PDF] On History-Deterministic One-Counter Nets.
We consider the model of history-deterministic one-counter nets (OCNs). History-
determinism is a property of transition systems that allows for a limited kind of non …
determinism is a property of transition systems that allows for a limited kind of non …
Computing the width of non-deterministic automata
We introduce a measure called width, quantifying the amount of nondeterminism in
automata. Width generalises the notion of good-for-games (GFG) automata, that correspond …
automata. Width generalises the notion of good-for-games (GFG) automata, that correspond …
Blow-up in Non-Deterministic Automata
I Baburin, R Cotterell - arxiv preprint arxiv:2407.09891, 2024 - arxiv.org
In this paper we examine the difficulty of finding an equivalent deterministic automaton when
confronted with a non-deterministic one. While for some automata the exponential blow-up …
confronted with a non-deterministic one. While for some automata the exponential blow-up …
Eventually safe languages
S Iosti, D Kuperberg - … Conference on Developments in Language Theory, 2019 - Springer
Abstract Good-for-Games (GFG) automata constitute a sound alternative to determinism as a
way to model specifications in the Church synthesis problem. Typically, inputs for the …
way to model specifications in the Church synthesis problem. Typically, inputs for the …
Alternative automata-based approaches to probabilistic model checking
D Müller - 2019 - tud.qucosa.de
Abstract (EN) In this thesis we focus on new methods for probabilistic model checking (PMC)
with linear temporal logic (LTL). The standard approach translates an LTL formula into a …
with linear temporal logic (LTL). The standard approach translates an LTL formula into a …
A Hierarchy of Nondeterminism
BA Radi, O Kupferman, O Leshkowitz - arxiv preprint arxiv:2209.09866, 2022 - arxiv.org
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 …
$\mathcal {A} $ is determinizable by pruning (DBP) if we can obtain a deterministic …