Zobrazeno 1 - 10
of 12
pro vyhledávání: '"Edon Kelmendi"'
Autor:
Edon Kelmendi
Publikováno v:
Logical Methods in Computer Science, Vol Volume 19, Issue 4 (2023)
The set of indices that correspond to the positive entries of a sequence of numbers is called its positivity set. In this paper, we study the density of the positivity set of a given linear recurrence sequence, that is the question of how much more f
Externí odkaz:
https://doaj.org/article/3e5698b2a4c8444fb1bfe84935d392f8
Publikováno v:
Logical Methods in Computer Science, Vol Volume 11, Issue 2 (2015)
The value 1 problem is a decision problem for probabilistic automata over finite words: given a probabilistic automaton, are there words accepted with probability arbitrarily close to 1? This problem was proved undecidable recently; to overcome this,
Externí odkaz:
https://doaj.org/article/77ee34e9f4bd43dda71f97548642022c
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031223365
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7fcc6e84afb8fc06c3bed879bd0312ce
https://doi.org/10.1007/978-3-031-22337-2_2
https://doi.org/10.1007/978-3-031-22337-2_2
Autor:
Edon Kelmendi
The set of indices that correspond to the positive entries of a sequence of numbers is called its positivity set. In this paper, we study the density of the positivity set of a given linear recurrence sequence, that is the question of how much more f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1d378663b4f4a737b74e92b932bba590
Publikováno v:
Proceedings of the ACM on Programming Languages
48th ACM SIGPLAN Symposium on Principles of Programming Languages
48th ACM SIGPLAN Symposium on Principles of Programming Languages
We consider the problem of deciding ω-regular properties on infinite traces produced by linear loops. Here we think of a given loop as producing a single infinite trace that encodes information about the signs of program variables at each time step.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6af71ab74a3bf837a630059333b9aa79
Publikováno v:
LICS
Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science
National Information Processing Institute
Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science
National Information Processing Institute
We consider extensions of monadic second-order logic over ω-words, which are obtained by adding one language that is not ω-regular. We show that if the added language L has a neutral letter, then the resulting logic is necessarily undecidable. A co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fd7c61428b16efb75176ae4dc2d33b68
Publikováno v:
LICS
2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
This paper is about an extension of monadic second-order logic over the full binary tree, which has a quantifier saying “almost surely a branch $\pi \in\{0,1\}^{\omega}$ satisfies a formula $\varphi(\pi)$ ”, This logic was introduced by Michalews
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a357166a24c5970cd84f9606397e9b1a
Simple stochastic games can be solved by value iteration (VI), which yields a sequence of under-approximations of the value of the game. This sequence is guaranteed to converge to the value only in the limit. Since no stopping criterion is known, thi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a1e2bfd1bee7fcc542121587ceea4b8f
Publikováno v:
Computer Aided Verification ISBN: 9783319961446
CAV (1)
CAV (1)
Simple stochastic games can be solved by value iteration (VI), which yields a sequence of under-approximations of the value of the game. This sequence is guaranteed to converge to the value only in the limit. Since no stopping criterion is known, thi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::df2e93a03d11a170e8bf95a59a3c5e70
https://doi.org/10.1007/978-3-319-96145-3_36
https://doi.org/10.1007/978-3-319-96145-3_36
Autor:
Hugo Gimbert, Edon Kelmendi
Publikováno v:
Algorithmic Game Theory ISBN: 9783662533536
SAGT
SAGT
Two-player, turn-based, stochastic games with reachability conditions are considered, where the maximizer has no information (he is blind) and is restricted to deterministic strategies whereas the minimizer is perfectly informed. We ask the question
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4eb4b6735bbb030922f3cbe69387a77d
https://doi.org/10.1007/978-3-662-53354-3_5
https://doi.org/10.1007/978-3-662-53354-3_5