default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartin Chmelik
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i15]Tomás Brázdil, Krishnendu Chatterjee, Martin Chmelik, Vojtech Forejt, Jan Kretínský, Marta Kwiatkowska, Tobias Meggendorfer, David Parker, Mateusz Ujma:
Learning Algorithms for Verification of Markov Decision Processes. CoRR abs/2403.09184 (2024)- 2020
- [c18]Krishnendu Chatterjee, Martin Chmelík, Deep Karkhanis, Petr Novotný, Amélie Royer:
Multiple-Environment Markov Decision Processes: Efficient Analysis and Applications. ICAPS 2020: 48-56
2010 – 2019
- 2018
- [c17]Krishnendu Chatterjee, Martin Chmelik, Ufuk Topcu:
Sensor Synthesis for POMDPs with Reachability Objectives. ICAPS 2018: 47-55 - 2017
- [i14]Krishnendu Chatterjee, Martin Chmelik, Ufuk Topcu:
Sensor Synthesis for POMDPs with Reachability Objectives. CoRR abs/1710.00675 (2017) - 2016
- [j5]Krishnendu Chatterjee, Martin Chmelik, Raghav Gupta, Ayush Kanodia:
Optimal cost almost-sure reachability in POMDPs. Artif. Intell. 234: 26-48 (2016) - [j4]Krishnendu Chatterjee, Martin Chmelik, Mathieu Tracol:
What is decidable about partially observable Markov decision processes with ω-regular objectives. J. Comput. Syst. Sci. 82(5): 878-911 (2016) - [c16]Krishnendu Chatterjee, Martin Chmelik, Jessica Davies:
A Symbolic SAT-Based Algorithm for Almost-Sure Reachability with Small Strategies in POMDPs. AAAI 2016: 3225-3232 - [c15]Krishnendu Chatterjee, Martin Chmelik:
Indefinite-Horizon Reachability in Goal-DEC-POMDPs. ICAPS 2016: 88-96 - [c14]Tomás Brázdil, Krishnendu Chatterjee, Martin Chmelik, Anchit Gupta, Petr Novotný:
Stochastic Shortest Path with Energy Constraints in POMDPs: (Extended Abstract). AAMAS 2016: 1465-1466 - [c13]Silviu S. Craciunas, Ramon Serna Oliver
, Martin Chmelík, Wilfried Steiner:
Scheduling Real-Time Communication in IEEE 802.1Qbv Time Sensitive Networks. RTNS 2016: 183-192 - [i13]Tomás Brázdil, Krishnendu Chatterjee, Martin Chmelik, Anchit Gupta, Petr Novotný:
Stochastic Shortest Path with Energy Constraints in POMDPs. CoRR abs/1602.07565 (2016) - 2015
- [j3]Krishnendu Chatterjee, Martin Chmelik:
POMDPs under probabilistic semantics. Artif. Intell. 221: 46-72 (2015) - [j2]Krishnendu Chatterjee, Martin Chmelik, Przemyslaw Daca:
CEGAR for compositional analysis of qualitative properties in Markov decision processes. Formal Methods Syst. Des. 47(2): 230-264 (2015) - [c12]Krishnendu Chatterjee, Martin Chmelik, Raghav Gupta, Ayush Kanodia:
Optimal Cost Almost-Sure Reachability in POMDPs. AAAI 2015: 3496-3502 - [c11]Tomás Brázdil, Krishnendu Chatterjee, Martin Chmelik, Andreas Fellner, Jan Kretínský:
Counterexample Explanation by Learning Small Strategies in Markov Decision Processes. CAV (1) 2015: 158-177 - [c10]María Svorenová, Martin Chmelik, Kevin Leahy, Hasan Ferit Eniser, Krishnendu Chatterjee, Ivana Cerná, Calin Belta:
Temporal logic motion planning using POMDPs with parity objectives: case study paper. HSCC 2015: 233-238 - [c9]María Svorenová, Jan Kretínský, Martin Chmelik, Krishnendu Chatterjee, Ivana Cerná, Calin Belta:
Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. HSCC 2015: 259-268 - [c8]Krishnendu Chatterjee, Martin Chmelik, Raghav Gupta, Ayush Kanodia:
Qualitative analysis of POMDPs with temporal logic specifications for robotics applications. ICRA 2015: 325-330 - [i12]Tomás Brázdil, Krishnendu Chatterjee, Martin Chmelik, Andreas Fellner, Jan Kretínský:
Counterexample Explanation by Learning Small Strategies in Markov Decision Processes. CoRR abs/1502.02834 (2015) - [i11]Krishnendu Chatterjee, Martin Chmelik, Jessica Davies:
A Symbolic SAT-based Algorithm for Almost-sure Reachability with Small Strategies in POMDPs. CoRR abs/1511.08456 (2015) - 2014
- [j1]Pavol Cerný, Martin Chmelik, Thomas A. Henzinger, Arjun Radhakrishna:
Interface simulation distances. Theor. Comput. Sci. 560: 348-363 (2014) - [c7]Tomás Brázdil, Krishnendu Chatterjee, Martin Chmelik, Vojtech Forejt, Jan Kretínský, Marta Z. Kwiatkowska, David Parker, Mateusz Ujma:
Verification of Markov Decision Processes Using Learning Algorithms. ATVA 2014: 98-114 - [c6]Krishnendu Chatterjee, Martin Chmelik, Przemyslaw Daca:
CEGAR for Qualitative Analysis of Probabilistic Systems. CAV 2014: 473-490 - [i10]Tomás Brázdil, Krishnendu Chatterjee, Martin Chmelik, Vojtech Forejt, Jan Kretínský, Marta Z. Kwiatkowska, David Parker, Mateusz Ujma:
Verification of Markov Decision Processes using Learning Algorithms. CoRR abs/1402.2967 (2014) - [i9]Krishnendu Chatterjee, Martin Chmelik, Przemyslaw Daca:
CEGAR for Qualitative Analysis of Probabilistic Systems. CoRR abs/1405.0835 (2014) - [i8]Krishnendu Chatterjee, Martin Chmelik:
POMDPs under Probabilistic Semantics. CoRR abs/1408.2058 (2014) - [i7]Krishnendu Chatterjee, Martin Chmelik, Raghav Gupta, Ayush Kanodia:
Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications. CoRR abs/1409.3360 (2014) - [i6]María Svorenová, Jan Kretínský, Martin Chmelik, Krishnendu Chatterjee, Ivana Cerná, Calin Belta:
Temporal Logic Control for Stochastic Linear Systems using Abstraction Refinement of Probabilistic Games. CoRR abs/1410.5387 (2014) - [i5]Krishnendu Chatterjee, Martin Chmelik, Raghav Gupta, Ayush Kanodia:
Optimal Cost Almost-sure Reachability in POMDPs. CoRR abs/1411.3880 (2014) - 2013
- [c5]Krishnendu Chatterjee, Martin Chmelik, Mathieu Tracol:
What is Decidable about Partially Observable Markov Decision Processes with omega-Regular Objectives. CSL 2013: 165-180 - [c4]Krishnendu Chatterjee, Martin Chmelik:
POMDPs under Probabilistic Semantics. UAI 2013 - [i4]Krishnendu Chatterjee, Martin Chmelik:
POMDPs under Probabilistic Semantics. CoRR abs/1308.4846 (2013) - [i3]Krishnendu Chatterjee, Martin Chmelik, Mathieu Tracol:
What is Decidable about Partially Observable Markov Decision Processes with ω-Regular Objectives. CoRR abs/1309.2802 (2013) - 2012
- [c3]Krishnendu Chatterjee, Martin Chmelik, Rupak Majumdar:
Equivalence of Games with Probabilistic Uncertainty and Partial-Observation Games. ATVA 2012: 385-399 - [c2]Martin Chmelik, Vojtech Rehák:
Controllable-Choice Message Sequence Graphs. MEMICS 2012: 118-130 - [c1]Pavol Cerný, Martin Chmelik, Thomas A. Henzinger, Arjun Radhakrishna:
Interface Simulation Distances. GandALF 2012: 29-42 - [i2]Krishnendu Chatterjee, Martin Chmelik, Rupak Majumdar:
Equivalence of Games with Probabilistic Uncertainty and Partial-observation Games. CoRR abs/1202.4140 (2012) - [i1]Martin Chmelik, Vojtech Rehák:
Controllable-choice Message Sequence Graphs. CoRR abs/1209.4499 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
