Folgen
Maximilian Weininger
Titel
Zitiert von
Zitiert von
Jahr
Building ProteomeTools based on a complete synthetic human proteome
DP Zolg, M Wilhelm, K Schnatbaum, J Zerweck, T Knaute, B Delanghe, ...
Nature methods 14 (3), 259-262, 2017
2282017
PAC statistical model checking for Markov decision processes and stochastic games
P Ashok, J Křetínský, M Weininger
Computer Aided Verification: 31st International Conference, CAV 2019, New …, 2019
492019
Value iteration for simple stochastic games: Stopping criterion and learning algorithm
E Kelmendi, J Krämer, J Křetínský, M Weininger
International conference on computer aided verification, 623-642, 2018
322018
SOS: safe, optimal and small strategies for hybrid Markov decision processes
P Ashok, J Křetínský, KG Larsen, A Le Coënt, JH Taankvist, M Weininger
Quantitative Evaluation of Systems: 16th International Conference, QEST 2019 …, 2019
282019
dtControl: Decision tree learning algorithms for controller representation
P Ashok, M Jackermeier, P Jagtap, J Křetínský, M Weininger, M Zamani
Proceedings of the 23rd international conference on hybrid systems …, 2020
262020
Comparison of algorithms for simple stochastic games
J Křetínský, E Ramneantu, A Slivinskiy, M Weininger
Information and Computation 289, 104885, 2022
202022
Automata tutor v3
L D’Antoni, M Helfrich, J Kretinsky, E Ramneantu, M Weininger
Computer Aided Verification: 32nd International Conference, CAV 2020, Los …, 2020
202020
Index appearance record for transforming Rabin automata into parity automata
J Křetínský, T Meggendorfer, C Waldmann, M Weininger
International Conference on Tools and Algorithms for the Construction and …, 2017
192017
dtControl 2.0: Explainable strategy representation via decision tree learning steered by experts
P Ashok, M Jackermeier, J Křetínský, C Weinhuber, M Weininger, ...
International Conference on Tools and Algorithms for the Construction and …, 2021
182021
Stochastic games with lexicographic reachability-safety objectives
K Chatterjee, JP Katoen, M Weininger, T Winkler
International Conference on Computer Aided Verification, 398-420, 2020
172020
Approximating values of generalized-reachability stochastic games
P Ashok, K Chatterjee, J Křetínský, M Weininger, T Winkler
Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer …, 2020
162020
A practitioner’s guide to MDP model checking algorithms
A Hartmanns, S Junges, T Quatmann, M Weininger
International Conference on Tools and Algorithms for the Construction and …, 2023
142023
Value iteration for simple stochastic games: Stopping criterion and learning algorithm
J Eisentraut, E Kelmendi, J Křetínský, M Weininger
Information and Computation 285, 104886, 2022
112022
Statistical model checking: black or white?
P Ashok, P Daca, J Křetínský, M Weininger
Leveraging Applications of Formal Methods, Verification and Validation …, 2020
92020
Satisfiability bounds for ω-regular properties in bounded-parameter Markov decision processes
M Weininger, T Meggendorfer, J Křetínský
2019 IEEE 58th Conference on Decision and Control (CDC), 2284-2291, 2019
92019
Optimistic and topological value iteration for simple stochastic games
M Azeem, A Evangelidis, J Křetínský, A Slivinskiy, M Weininger
International Symposium on Automated Technology for Verification and …, 2022
82022
Index appearance record with preorders
J Křetínský, T Meggendorfer, C Waldmann, M Weininger
Acta Informatica 59 (5), 585-618, 2022
82022
Stopping criteria for value iteration on stochastic games with quantitative objectives
J Křetínský, T Meggendorfer, M Weininger
2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-14, 2023
52023
Anytime guarantees for reachability in uncountable markov decision processes
K Grover, J Křetínský, T Meggendorfer, M Weininger
arXiv preprint arXiv:2008.04824, 2020
52020
Algebraically explainable controllers: decision trees and support vector machines join forces
F Jüngermann, J Křetínský, M Weininger
International Journal on Software Tools for Technology Transfer 25 (3), 249-266, 2023
42023
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20