Holger Hermanns
Holger Hermanns
Professor of Computer Science, Saarland University, Saarland Informatics Campus
Dirección de correo verificada de - Página principal
Citado por
Citado por
Model-checking algorithms for continuous-time Markov chains
C Baier, B Haverkort, H Hermanns, JP Katoen
IEEE Transactions on software engineering 29 (6), 524-541, 2003
Interactive Markov Chains and the Quest for Quantified Quality
H Hermanns
Lecture Notes in Computer Science 2428, 2002
Interactive Markov chains
H Hermanns
Friedrich Alexander Universität Erlangen-Nürnberg, 1998
Interactive Markov Chains
H Hermanns
PhD Thesis, 1998
The ins and outs of the probabilistic model checker MRMC
JP Katoen, IS Zapreev, EM Hahn, H Hermanns, DN Jansen
Performance evaluation 68 (2), 90-104, 2011
What do we want from Explainable Artificial Intelligence (XAI)?–A stakeholder perspective on XAI and a conceptual model guiding interdisciplinary XAI research
M Langer, D Oster, T Speith, H Hermanns, L Kästner, E Schmidt, A Sesing, ...
Artificial Intelligence 296, 103473, 2021
Approximative symbolic model checking of continuous-time Markov chains
C Baier, JP Katoen, H Hermanns
CONCUR’99 Concurrency Theory: 10th International Conference Eindhoven, The …, 1999
Process algebra for performance evaluation
H Hermanns, U Herzog, JP Katoen
Theoretical computer science 274 (1-2), 43-87, 2002
Optimal state-space lumping in Markov chains
S Derisavi, H Hermanns, WH Sanders
Information processing letters 87 (6), 309-315, 2003
Probabilistic reachability for parametric Markov models
EM Hahn, H Hermanns, L Zhang
International Journal on Software Tools for Technology Transfer 13, 3-19, 2011
Probabilistic CEGAR
H Hermanns, B Wachter, L Zhang
Computer Aided Verification, 162-175, 2008
Syntax, semantics, equivalences, and axioms for MTIPP
H Hermanns, M Rettelbach
Proc. of the 2nd Workshop on Process Algebras and Performance Modelling, 71-88, 1994
Model checking continuous-time Markov chains by transient analysis
C Baier, B Haverkort, H Hermanns, JP Katoen
International conference on computer aided verification, 358-372, 2000
Weak bisimulation for fully probabilistic processes
C Baier, H Hermanns
Computer Aided Verification: 9th International Conference, CAV'97 Haifa …, 1997
On probabilistic automata in continuous time
C Eisentraut, H Hermanns, L Zhang
2010 25th Annual IEEE Symposium on Logic in Computer Science, 342-351, 2010
MoDeST: A compositional modeling formalism for hard and softly timed systems
H Bohnenkamp, PR d'Argenio, H Hermanns, JP Katoen
IEEE Transactions on Software Engineering 32 (10), 812-830, 2006
Discrete-time rewards model-checked
S Andova, H Hermanns, JP Katoen
Formal Modeling and Analysis of Timed Systems: First International Workshop …, 2004
The Modest Toolset: An integrated environment for quantitative modelling and verification
A Hartmanns, H Hermanns
International Conference on Tools and Algorithms for the Construction and …, 2014
Multi terminal binary decision diagrams to represent and analyse continuous time Markov chains
H Hermanns, J Meyer-Kayser, M Siegle
Proc. NSMC 99, 188-207, 1999
Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes
C Baier, H Hermanns, JP Katoen, BR Haverkort
Theoretical Computer Science 345 (1), 2-26, 2005
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20