![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Pranav Ashok
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [c13]Jonis Kiesbye, Kush Grover
, Pranav Ashok, Jan Kretínský:
Planning via model checking with decision-tree controllers. ICRA 2022: 4347-4354 - 2021
- [b1]Pranav Ashok:
A Learning Twist on Controllers: Synthesis via Partial Exploration and Concise Representations. Technical University of Munich, Germany, 2021 - [c12]Pranav Ashok
, Mathias Jackermeier
, Jan Kretínský
, Christoph Weinhuber
, Maximilian Weininger
, Mayank Yadav
:
dtControl 2.0: Explainable Strategy Representation via Decision Tree Learning Steered by Experts. TACAS (2) 2021: 326-345 - [i10]Pranav Ashok, Mathias Jackermeier, Jan Kretínský, Christoph Weinhuber, Maximilian Weininger, Mayank Yadav:
dtControl 2.0: Explainable Strategy Representation via Decision Tree Learning Steered by Experts. CoRR abs/2101.07202 (2021) - 2020
- [c11]Pranav Ashok
, Vahid Hashemi
, Jan Kretínský
, Stefanie Mohr
:
DeepAbstract: Neural Network Abstraction for Accelerating Verification. ATVA 2020: 92-107 - [c10]Pranav Ashok
, Mathias Jackermeier, Pushpak Jagtap
, Jan Kretínský, Maximilian Weininger
, Majid Zamani:
dtControl: decision tree learning algorithms for controller representation. HSCC 2020: 17:1-17:7 - [c9]Pranav Ashok, Mathias Jackermeier
, Pushpak Jagtap
, Jan Kretínský, Maximilian Weininger
, Majid Zamani:
dtControl: decision tree learning algorithms for controller representation. HSCC 2020: 30:1-30:2 - [c8]Pranav Ashok, Przemyslaw Daca, Jan Kretínský, Maximilian Weininger
:
Statistical Model Checking: Black or White? ISoLA (1) 2020: 331-349 - [c7]Pranav Ashok
, Krishnendu Chatterjee, Jan Kretínský, Maximilian Weininger
, Tobias Winkler
:
Approximating Values of Generalized-Reachability Stochastic Games. LICS 2020: 102-115 - [i9]Pranav Ashok, Mathias Jackermeier, Pushpak Jagtap, Jan Kretínský, Maximilian Weininger, Majid Zamani:
dtControl: Decision Tree Learning Algorithms for Controller Representation. CoRR abs/2002.04991 (2020) - [i8]Pranav Ashok
, Vahid Hashemi, Jan Kretínský, Stefanie Mohr:
DeepAbstract: Neural Network Abstraction for Accelerating Verification. CoRR abs/2006.13735 (2020)
2010 – 2019
- 2019
- [c6]Pranav Ashok
, Jan Kretínský, Maximilian Weininger
:
PAC Statistical Model Checking for Markov Decision Processes and Stochastic Games. CAV (1) 2019: 497-519 - [c5]Pranav Ashok
, Tomás Brázdil, Krishnendu Chatterjee, Jan Kretínský, Christoph H. Lampert, Viktor Toman
:
Strategy Representation by Decision Trees with Linear Classifiers. QEST 2019: 109-128 - [c4]Pranav Ashok
, Jan Kretínský, Kim Guldstrand Larsen
, Adrien Le Coënt, Jakob Haahr Taankvist, Maximilian Weininger
:
SOS: Safe, Optimal and Small Strategies for Hybrid Markov Decision Processes. QEST 2019: 147-164 - [i7]Pranav Ashok, Jan Kretínský, Maximilian Weininger:
PAC Statistical Model Checking for Markov Decision Processes and Stochastic Games. CoRR abs/1905.04403 (2019) - [i6]Pranav Ashok, Tomás Brázdil, Krishnendu Chatterjee, Jan Kretínský, Christoph H. Lampert, Viktor Toman:
Strategy Representation by Decision Trees with Linear Classifiers. CoRR abs/1906.08178 (2019) - [i5]Pranav Ashok, Jan Kretínský, Kim Guldstrand Larsen, Adrien Le Coënt, Jakob Haahr Taankvist, Maximilian Weininger:
SOS: Safe, Optimal and Small Strategies for Hybrid Markov Decision Processes. CoRR abs/1906.10640 (2019) - [i4]Pranav Ashok
, Jan Kretínský, Maximilian Weininger:
Approximating Values of Generalized-Reachability Stochastic Games. CoRR abs/1908.05106 (2019) - 2018
- [c3]Pranav Ashok
, Yuliya Butkova
, Holger Hermanns
, Jan Kretínský
:
Continuous-Time Markov Decisions Based on Partial Exploration. ATVA 2018: 317-334 - [c2]Pranav Ashok
, Tomás Brázdil, Jan Kretínský, Ondrej Slámecka:
Monte Carlo Tree Search for Verifying Reachability in Markov Decision Processes. ISoLA (2) 2018: 322-335 - [i3]Pranav Ashok, Yuliya Butkova, Holger Hermanns, Jan Kretínský:
Continuous-Time Markov Decisions based on Partial Exploration. CoRR abs/1807.09641 (2018) - [i2]Pranav Ashok, Tomás Brázdil, Jan Kretínský, Ondrej Slámecka:
Monte Carlo Tree Search for Verifying Reachability in Markov Decision Processes. CoRR abs/1809.03299 (2018) - 2017
- [c1]Pranav Ashok
, Krishnendu Chatterjee, Przemyslaw Daca, Jan Kretínský, Tobias Meggendorfer
:
Value Iteration for Long-Run Average Reward in Markov Decision Processes. CAV (1) 2017: 201-221 - [i1]Pranav Ashok, Krishnendu Chatterjee, Przemyslaw Daca, Jan Kretínský, Tobias Meggendorfer:
Value Iteration for Long-run Average Reward in Markov Decision Processes. CoRR abs/1705.02326 (2017)
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-08-05 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint