Zobrazeno 1 - 10
of 18
pro vyhledávání: '"Vahanwala, Mihir"'
Autor:
Aghamov, Rajab, Baier, Christel, Karimov, Toghrul, Nieuwveld, Joris, Ouaknine, Joël, Piribauer, Jakob, Vahanwala, Mihir
The conventional perspective on Markov chains considers decision problems concerning the probabilities of temporal properties being satisfied by traces of visited states. However, consider the following query made of a stochastic system modelling the
Externí odkaz:
http://arxiv.org/abs/2406.15087
Autor:
Berthé, Valérie, Karimov, Toghrul, Nieuwveld, Joris, Ouaknine, Joël, Vahanwala, Mihir, Worrell, James
We investigate the decidability of the monadic second-order (MSO) theory of the structure $\langle \mathbb{N};<,P_1, \ldots,P_k \rangle$, for various unary predicates $P_1,\ldots,P_k \subseteq \mathbb{N}$. We focus in particular on "arithmetic" predi
Externí odkaz:
http://arxiv.org/abs/2405.07953
For which unary predicates $P_1, \ldots, P_m$ is the MSO theory of the structure $\langle \mathbb{N}; <, P_1, \ldots, P_m \rangle$ decidable? We survey the state of the art, leading us to investigate combinatorial properties of almost-periodic, morph
Externí odkaz:
http://arxiv.org/abs/2311.04895
Autor:
Vahanwala, Mihir
Linear Dynamical Systems, both discrete and continuous, are invaluable mathematical models in a plethora of applications such the verification of probabilistic systems, model checking, computational biology, cyber-physical systems, and economics. We
Externí odkaz:
http://arxiv.org/abs/2308.06421
Autor:
Abdulla, Parosh Aziz, Atig, Mohamed Faouzi, Godbole, Adwait, Krishna, Shankaranarayanan, Vahanwala, Mihir
We consider the verification of omega-regular linear temporal properties of concurrent programs running under weak memory semantics. We observe that in particular, these properties may enforce liveness clauses, whose verification in this context is s
Externí odkaz:
http://arxiv.org/abs/2305.17605
Autor:
Vahanwala, Mihir
We consider the following Markov Reachability decision problems that view Markov Chains as Linear Dynamical Systems: given a finite, rational Markov Chain, source and target states, and a rational threshold, does the probability of reaching the targe
Externí odkaz:
http://arxiv.org/abs/2305.04881
Autor:
Vahanwala, Mihir
Linear Recurrence Sequences (LRS) are a fundamental mathematical primitive for a plethora of applications such as the verification of probabilistic systems, model checking, computational biology, and economics. Positivity (are all terms of the given
Externí odkaz:
http://arxiv.org/abs/2305.04870
Publikováno v:
Logical Methods in Computer Science, Volume 20, Issue 2 (June 5, 2024) lmcs:10261
The Skolem problem is a long-standing open problem in linear dynamical systems: can a linear recurrence sequence (LRS) ever reach 0 from a given initial configuration? Similarly, the positivity problem asks whether the LRS stays positive from an init
Externí odkaz:
http://arxiv.org/abs/2211.02365
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.
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.