Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Claudia Calabrese
Min Liu
Hao Mao
Peter Malec
Giovanni Venturelli
Chen Ma
Radu Timofte
Kuanrui Yin
Silvia Licciardi
Carsten Rethfeldt
Home
/
Author
/
JAN KŘETÍNSKÝ
Author Info
Open Visualization
Name
Affiliation
Papers
JAN KŘETÍNSKÝ
Faculty of Informatics, Masaryk University, Brno, Czech Republic,Institut für Informatik, Technische Universität München, Germany
24
Collaborators
Citations
PageRank
37
190
12.05
Referers
Referees
References
242
423
444
Search Limit
100
423
Publications (24 rows)
Collaborators (37 rows)
Referers (100 rows)
Referees (100 rows)
Title
Citations
PageRank
Year
LTL-Constrained Steady-State Policy Synthesis.
0
0.34
2021
Assessing Security Of Cryptocurrencies With Attack-Defense Trees: Proof Of Concept And Future Directions
0
0.34
2021
Logical vs. behavioural specifications.
0
0.34
2020
Semantic Labelling and Learning for Parity Game Solving in LTL Synthesis.
0
0.34
2019
Rabinizer 4: From Ltl To Your Favourite Deterministic Automaton
2
0.37
2018
The Satisfiability Problem for Unbounded Fragments of Probabilistic CTL.
0
0.34
2018
Efficient Strategy Iteration for Mean Payoff in Markov Decision Processes.
3
0.37
2017
Value Iteration For Long-Run Average Reward In Markov Decision Processes
8
0.44
2017
Refinement checking on parametric modal transition systems.
2
0.36
2015
On time-average limits in deterministic and stochastic petri nets
0
0.34
2013
Automata with generalized rabin pairs for probabilistic model checking and LTL synthesis
22
0.83
2013
Hennessy-Milner logic with greatest fixed points as a complete behavioural specification theory
7
0.49
2013
Continuous-time stochastic games with time-bounded reachability
13
0.66
2013
Compositional verification and optimization of interactive markov chains
5
0.40
2013
Rabinizer: small deterministic automata for LTL (F,G)
18
0.84
2012
Deterministic automata for the (f, g)-fragment of LTL
26
0.96
2012
Dual-Priced modal transition systems with time durations
8
0.47
2012
EXPTIME-completeness of thorough refinement on modal transition systems
4
0.39
2012
Modal process rewrite systems
2
0.37
2012
Fixed-delay events in generalized semi-Markov processes revisited
7
0.57
2011
Modal transition systems: composition and LTL model checking
20
0.67
2011
Parametric modal transition systems
14
0.54
2011
Stochastic real-time games with qualitative timed automata objectives
10
0.57
2010
Checking Thorough Refinement on Modal Transition Systems Is EXPTIME-Complete
19
0.72
2009
1