Zobrazeno 1 - 10
of 14
pro vyhledávání: '"Martin Chmelík"'
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 96, Iss Proc. GandALF 2012, Pp 29-42 (2012)
The classical (boolean) notion of refinement for behavioral interfaces of system components is the alternating refinement preorder. In this paper, we define a distance for interfaces, called interface simulation distance. It makes the alternating ref
Externí odkaz:
https://doaj.org/article/007b56c5b1444100a72a55514b6881a5
Publikováno v:
Journal of Computer and System Sciences. 82:878-911
Decidability of qualitative analysis of parity POMDPs under finite-memory strategies.Optimal memory bounds and complexity (EXPTIME-completeness) for the above problem.Implementation of our algorithm with several heuristics and experimental results. W
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f877baa3086d399db7c48408956d4dd8
https://doi.org/10.1016/j.jcss.2016.02.009
https://doi.org/10.1016/j.jcss.2016.02.009
Autor:
Krishnendu Chatterjee, Martin Chmelík
Publikováno v:
Proceedings of the International Conference on Automated Planning and Scheduling. 26:88-96
DEC-POMDPs extend POMDPs to a multi-agent setting, where several agents operate in an uncertain environment independently to achieve a joint objective. DEC-POMDPs have been studied with finite-horizon and infinite-horizon discounted-sum objectives, a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1013e93913345e284f89be4ecbb123a7
https://doi.org/10.1609/icaps.v26i1.13737
https://doi.org/10.1609/icaps.v26i1.13737
Publikováno v:
Lohse, K, Chmelik, M, Martin, S & Barton, N H 2016, ' Efficient Strategies for Calculating Blockwise Likelihoods under the Coalescent ', Genetics, vol. 202, no. 2, pp. 775-786 . https://doi.org/10.1534/genetics.115.183814
Genetics
Genetics
The inference of demographic history from genome data is hindered by a lack of efficient computational approaches. In particular, it has proven difficult to exploit the information contained in the distribution of genealogies across the genome. We ha
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::93bae8818ef11e9e0ca3d58b9a6f0f7e
https://doi.org/10.1101/016469
https://doi.org/10.1101/016469
Publikováno v:
Proceedings of the AAAI Conference on Artificial Intelligence. 29
We consider partially observable Markov decision processes (POMDPs) with a set of target states and every transition is associated with an integer cost. The optimization objective we study asks to minimize the expected total cost till the target set
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::12e65fb2730233bb7731746ede0bdb09
https://doi.org/10.1609/aaai.v29i1.9683
https://doi.org/10.1609/aaai.v29i1.9683
Publikováno v:
Computer Aided Verification ISBN: 9783319216898
CAV (1)
CAV (1)
For deterministic systems, a counterexample to a property can simply be an error trace, whereas counterexamples in probabilistic systems are necessarily more complex. For instance, a set of erroneous traces with a sufficient cumulative probability ma
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::494af81c5250317f12dc85ccdc526aeb
https://doi.org/10.1007/978-3-319-21690-4_10
https://doi.org/10.1007/978-3-319-21690-4_10
Publikováno v:
ICRA
We consider partially observable Markov decision processes (POMDPs), that are a standard framework for robotics applications to model uncertainties present in the real world, with temporal logic specifications. All temporal logic specifications in li
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::59b877a9c4faa0caaae798cca8de9615
http://arxiv.org/abs/1409.3360
http://arxiv.org/abs/1409.3360
Autor:
David Parker, Krishnendu Chatterjee, Vojtěch Forejt, Marta Kwiatkowska, Tomáš Brázdil, Jan Křetínský, Martin Chmelík, Mateusz Ujma
Publikováno v:
Lecture Notes in Computer Science
Automated Technology for Verification and Analysis ISBN: 9783319119359
ATVA
Automated Technology for Verification and Analysis ISBN: 9783319119359
ATVA
We present a general framework for applying machine-learning algorithms to the verification of Markov decision processes (MDPs). The primary goal of these techniques is to improve performance by avoiding an exhaustive exploration of the state space.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::186c48c41e04350d8c26a198e69eee81
Autor:
Krishnendu Chatterjee, Mária Svoreňová, Calin Belta, Martin Chmelík, Ivana Černá, Jan Křetínský
Publikováno v:
HSCC
We consider the problem of computing the set of initial states of a dynamical system such that there exists a control strategy to ensure that the trajectories satisfy a temporal logic specification with probability 1 (almost-surely). We focus on disc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fa47b1db16d4124759dbc92e75b867cb
Publikováno v:
Lecture Notes in Computer Science
Computer Aided Verification ISBN: 9783319088662
CAV
Computer Aided Verification ISBN: 9783319088662
CAV
We consider Markov decision processes (MDPs) which are a standard model for probabilistic systems.We focus on qualitative properties forMDPs that can express that desired behaviors of the system arise almost-surely (with probability 1) or with positi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7763c315dd924c9c33a3e9e069023540