Zobrazeno 1 - 10
of 21
pro vyhledávání: '"Shibashis Guha"'
Publikováno v:
Logical Methods in Computer Science, Vol Volume 20, Issue 1 (2024)
We study the expressiveness and succinctness of history-deterministic pushdown automata (HD-PDA) over finite words, that is, pushdown automata whose nondeterminism can be resolved based on the run constructed so far, but independently of the remainde
Externí odkaz:
https://doaj.org/article/03ee626ded51408a95e4d810f7c4816d
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 120, Iss Proc. EXPRESS/SOS 2013, Pp 47-62 (2013)
In this paper we present a unifying approach for deciding various bisimulations, simulation equivalences and preorders between two timed automata states. We propose a zone based method for deciding these relations in which we eliminate an explicit pr
Externí odkaz:
https://doaj.org/article/b245777351ec4a078e7ba28ca8bc8d0d
Publikováno v:
Games, Vol 9, Iss 3, p 39 (2018)
Network games (NGs) are played on directed graphs and are extensively used in network design and analysis. Search problems for NGs include finding special strategy profiles such as a Nash equilibrium and a globally-optimal solution. The networks mode
Externí odkaz:
https://doaj.org/article/ad201db95f7e4bf6936f13303f4ef4ba
Publikováno v:
Developments in Language Theory ISBN: 9783031332630
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f9f520888f3e2d94e44060d6782ea9ae
https://doi.org/10.1007/978-3-031-33264-7_4
https://doi.org/10.1007/978-3-031-33264-7_4
Autor:
Sasha Rubin, Emmanuel Filiot, Aniello Murano, Sophie Pinchinat, Olivier Serre, Shibashis Guha, Bastien Maubert, Nathanaël Fijalkow, Laureline Pinault, Raphaël Berthon
Publikováno v:
ACM Transactions on Computational Logic
ACM Transactions on Computational Logic, 2021, 22 (1), pp.1-24. ⟨10.1145/3431860⟩
ACM Transactions on Computational Logic, Association for Computing Machinery, 2020, 22 (1), ⟨10.1007/s00037-021-00214-1⟩
ACM Transactions on Computational Logic, 2020, 22 (1), ⟨10.1145/3431860⟩
ACM Transactions on Computational Logic, 2021, 22 (1), pp.1-24. ⟨10.1145/3431860⟩
ACM Transactions on Computational Logic, Association for Computing Machinery, 2020, 22 (1), ⟨10.1007/s00037-021-00214-1⟩
ACM Transactions on Computational Logic, 2020, 22 (1), ⟨10.1145/3431860⟩
We study alternating automata with qualitative semantics over infinite binary trees: Alternation means that two opposing players construct a decoration of the input tree called a run, and the qualitative semantics says that a run of the automaton is
Publikováno v:
Computer Aided Verification ISBN: 9783031131875
Markov decision processes (MDP) and continuous-time MDP (CTMDP) are the fundamental models for non-deterministic systems with probabilistic uncertainty. Mean payoff (a.k.a. long-run average reward) is one of the most classic objectives considered in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::41e4644d48a2b6e6a6a5b64de0f1a26b
https://doi.org/10.1007/978-3-031-13188-2_1
https://doi.org/10.1007/978-3-031-13188-2_1
Publikováno v:
AAMAS
In the traditional maximum-flow problem, the goal is to transfer maximum flow in a network by directing, in each vertex in the network, incoming flow to outgoing edges. The problem corresponds to settings in which a central authority has control on a
Autor:
Shibashis Guha, Dhiman Chakraborty, Damien Busatto-Gaston, Guillermo A. Pérez, Jean-François Raskin
Publikováno v:
Quantitative Evaluation of Systems ISBN: 9783030851712
QEST
QEST
In this paper, we investigate the combination of synthesis, model-based learning, and online sampling techniques to obtain safe and near-optimal schedulers for a preemptible task scheduling problem. Our algorithms can handle Markov decision processes
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e3b51c6dca5f5c5059c36cf8dddeed98
https://doi.org/10.1007/978-3-030-85172-9_13
https://doi.org/10.1007/978-3-030-85172-9_13
Publikováno v:
LICS
Proceedings
Proceedings
In this paper, we consider algorithms to decide the existence of strategies in MDPs for Boolean combinations of objectives. These objectives are omega-regular properties that need to be enforced either surely, almost surely, existentially, or with no
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::edad0a0abb1aaab09433542aefd5349d
http://arxiv.org/abs/2004.13789
http://arxiv.org/abs/2004.13789
Autor:
Shibashis Guha, Ashutosh Trivedi
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030296612
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::85f3a08127fecb0cabbdc731870c6229
https://doi.org/10.1007/978-3-030-29662-9_17
https://doi.org/10.1007/978-3-030-29662-9_17