Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Sağlam, Irmak"'
We provide an algorithm to solve Rabin and Streett games over graphs with $n$ vertices, $m$ edges, and $k$ colours that runs in $\tilde{O}\left(mn(k!)^{1+o(1)} \right)$ time and $O(nk\log k \log n)$ space, where $\tilde{O}$ hides poly-logarithmic fac
Externí odkaz:
http://arxiv.org/abs/2401.07548
We study the problem of deciding whether a given language is directed. A language $L$ is \emph{directed} if every pair of words in $L$ have a common (scattered) superword in $L$. Deciding directedness is a fundamental problem in connection with ideal
Externí odkaz:
http://arxiv.org/abs/2401.07106
We consider two-player games over finite graphs in which both players are restricted by fairness constraints on their moves. Given a two player game graph $G=(V,E)$ and a set of fair moves $E_f\subseteq E$ a player is said to play "fair" in $G$ if th
Externí odkaz:
http://arxiv.org/abs/2310.13612
This paper considers the problem of solving infinite two-player games over finite graphs under various classes of progress assumptions motivated by applications in cyber-physical system (CPS) design. Formally, we consider a game graph G, a temporal s
Externí odkaz:
http://arxiv.org/abs/2310.12767
Autor:
Sağlam, Irmak, Schmuck, Anne-Kathrin
This paper discusses the problem of efficiently solving parity games where player Odd has to obey an additional 'strong transition fairness constraint' on its vertices -- given that a player Odd vertex $v$ is visited infinitely often, a particular su
Externí odkaz:
http://arxiv.org/abs/2307.13396
Autor:
Kaya, Burak, Saglam, Irmak
In this paper, we contribute to the study of topological partition relations for pairs of countable ordinals and prove that, for all integers $n \geq 3$, \begin{align*} R^{cl}(\omega+n,3) &\geq \omega^2 \cdot n + \omega \cdot (R(n,3)-n)+n\\ R^{cl}(\o
Externí odkaz:
http://arxiv.org/abs/2005.09519
Autor:
Saglam, Irmak, Gol, Ebru Aydin
In this work, we develop an approach to anomaly detection and prevention problem using Signal Temporal Logic (STL). This approach consists of two steps: detection of the causes of the anomalities as STL formulas and prevention of the satisfaction of
Externí odkaz:
http://arxiv.org/abs/2003.09918
Autor:
Saglam, Irmak, Gol, Ebru Aydin
Formal control of cyber-physical systems allows for synthesis of control strategies from rich specifications such as temporal logics. However, the classes of systems that the formal approaches can be applied to is limited due to the computational com
Externí odkaz:
http://arxiv.org/abs/1904.03649
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Kaya, Burak, Sağlam, Irmak
Publikováno v:
Israel Journal of Mathematics; Oct2021, Vol. 245 Issue 2, p963-989, 27p
