Spremljaj
Holger Hermanns
Holger Hermanns
Professor of Computer Science, Saarland University, Saarland Informatics Campus
Preverjeni e-poštni naslov na cs.uni-saarland.de - Domača stran
Naslov
Navedeno
Navedeno
Leto
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
10102003
Interactive Markov Chains and the Quest for Quantified Quality
H Hermanns
Lecture Notes in Computer Science 2428, 2002
701*2002
Interactive Markov chains
H Hermanns
Friedrich Alexander Universität Erlangen-Nürnberg, 1998
658*1998
Interactive Markov Chains
H Hermanns
PhD Thesis, 1998
658*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
4422011
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
3671999
Process algebra for performance evaluation
H Hermanns, U Herzog, JP Katoen
Theoretical computer science 274 (1-2), 43-87, 2002
3522002
Optimal state-space lumping in Markov chains
S Derisavi, H Hermanns, WH Sanders
Information processing letters 87 (6), 309-315, 2003
2732003
Probabilistic CEGAR
H Hermanns, B Wachter, L Zhang
Computer Aided Verification, 162-175, 2008
2432008
Probabilistic reachability for parametric Markov models
EM Hahn, H Hermanns, L Zhang
International Journal on Software Tools for Technology Transfer 13, 3-19, 2011
2392011
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
2381994
Model checking continuous-time Markov chains by transient analysis
C Baier, B Haverkort, H Hermanns, JP Katoen
Computer Aided Verification: 12th International Conference, CAV 2000 …, 2000
2292000
Weak bisimulation for fully probabilistic processes
C Baier, H Hermanns
Computer Aided Verification: 9th International Conference, CAV'97 Haifa …, 1997
2021997
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
1952010
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
1902006
Discrete-time rewards model-checked
S Andova, H Hermanns, JP Katoen
Lecture notes in computer science 2791, 88-104, 2004
1872004
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
1841999
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
1812021
Comparative branching-time semantics for Markov chains
C Baier, JP Katoen, H Hermanns, V Wolf
Information and computation 200 (2), 149-214, 2005
1752005
The Modest Toolset: An integrated environment for quantitative modelling and verification
A Hartmanns, H Hermanns
Tools and Algorithms for the Construction and Analysis of Systems: 20th …, 2014
1692014
Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.
Članki 1–20