Jan Křetínský
Jan Křetínský
Technical University of Munich (tenure-track assistant professor)
Verified email at fi.muni.cz - Homepage
Title
Cited by
Cited by
Year
Verification of Markov decision processes using learning algorithms
T Brázdil, K Chatterjee, M Chmelik, V Forejt, J Křetínský, M Kwiatkowska, ...
International Symposium on Automated Technology for Verification and …, 2014
1462014
The Hanoi Omega-Automata Format
T Babiak, F Blahoudek, A Duret-Lutz, J Klein, J Křetínský, M David, ...
Computer Aided Verification, 2015
572015
The satisfiability problem for probabilistic CTL
T Brázdil, V Forejt, J Kretinsky, A Kucera
Logic in Computer Science, 2008. LICS'08. 23rd Annual IEEE Symposium on, 391-402, 2008
552008
Limit-deterministic Büchi automata for linear temporal logic
S Sickert, J Esparza, S Jaax, J Křetínský
International Conference on Computer Aided Verification, 312-332, 2016
532016
From LTL to Deterministic Automata: A Safraless Compositional Approach
J Esparza, J Křetínský
Computer Aided Verification, 2014
502014
Automata with generalized Rabin pairs for probabilistic model checking and LTL synthesis
K Chatterjee, A Gaiser, J Křetínský
International Conference on Computer Aided Verification, 559-575, 2013
492013
On determinism in modal transition systems
N Beneš, J Křetínský, KG Larsen, J Srba
Theoretical Computer Science 410 (41), 4026-4043, 2009
492009
Deterministic Automata for the (F, G)-Fragment of LTL
J Křetínský, J Esparza
Computer Aided Verification, 7-22, 2012
472012
Continuous-time stochastic games with time-bounded reachability
T Brázdil, V Forejt, J Krcal, J Kretınský, A Kucera
FSTTCS. LIPIcs 4, 61-72, 2009
432009
Probabilistic bisimulation: Naturally on distributions
H Hermanns, J Krčál, J Křetínský
International Conference on Concurrency Theory, 249-265, 2014
402014
Rabinizer 3: Safraless translation of LTL to small deterministic automata
Z Komárková, J Křetínský
International Symposium on Automated Technology for Verification and …, 2014
392014
Checking thorough refinement on modal transition systems is exptime-complete
N Beneš, J Křetínský, K Larsen, J Srba
Theoretical Aspects of Computing-ICTAC 2009, 112-126, 2009
382009
Parametric modal transition systems
N Beneš, J Křetínský, K Larsen, M Mřller, J Srba
Automated Technology for Verification and Analysis, 275-289, 2011
372011
Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes
K Chatterjee, Z Komárková, J Křetínský
Logic in Computer Science, 2015
352015
Modal transition systems: Composition and LTL model checking
N Beneš, I Černá, J Křetínský
International Symposium on Automated Technology for Verification and …, 2011
342011
Continuous-time stochastic games with time-bounded reachability
T BráZdil, V Forejt, J KrčáL, J KřEtíNský, AN KučEra
Information and Computation 224, 46-70, 2013
252013
Stochastic real-time games with qualitative timed automata objectives
T Brázdil, J Krčál, J Křetínský, A Kučera, V Řehák
International Conference on Concurrency Theory, 207-221, 2010
252010
Hennessy-Milner logic with greatest fixed points as a complete behavioural specification theory
N Beneš, B Delahaye, U Fahrenberg, J Křetínský, A Legay
International Conference on Concurrency Theory, 76-90, 2013
242013
Value iteration for long-run average reward in Markov decision processes
P Ashok, K Chatterjee, P Daca, J Křetínský, T Meggendorfer
International Conference on Computer Aided Verification, 201-221, 2017
232017
Faster statistical model checking for unbounded temporal properties
P Daca, TA Henzinger, J Křetínský, T Petrov
ACM Transactions on Computational Logic (TOCL) 18 (2), 1-25, 2017
232017
The system can't perform the operation now. Try again later.
Articles 1–20