Holger Hermanns
Holger Hermanns
Professor of Computer Science, Saarland University, Saarland Informatics Campus
Verified email at cs.uni-saarland.de - Homepage
Title
Cited by
Cited by
Year
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
9122003
Interactive Markov Chains and the Quest for Quantified Quality
H Hermanns
Lecture Notes in Computer Science 2428, 2002
652*2002
Interactive Markov chains
H Hermanns
Friedrich Alexander Universität Erlangen-Nürnberg, 1998
612*1998
Interactive Markov Chains
H Hermanns
PhD Thesis, 1998
612*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
3972011
Approximative symbolic model checking of continuous-time Markov chains
C Baier, JP Katoen, H Hermanns
International Conference on Concurrency Theory, 146-161, 1999
3451999
Process algebra for performance evaluation
H Hermanns, U Herzog, JP Katoen
Theoretical computer science 274 (1-2), 43-87, 2002
3212002
Optimal state-space lumping in Markov chains
S Derisavi, H Hermanns, WH Sanders
Information Processing Letters 87 (6), 309-315, 2003
2422003
Syntax, semantics, equivalences, and axioms for MTIPP
H Hermanns, M Rettelbach
in Proc. of the 2nd Workshop on Process Algebras and Performance Modelling …, 1994
2271994
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
2102000
Probabilistic CEGAR
H Hermanns, B Wachter, L Zhang
Computer Aided Verification, 162-175, 2008
2092008
Weak bisimulation for fully probabilistic processes
C Baier, H Hermanns
International Conference on Computer Aided Verification, 119-130, 1997
1851997
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
1762010
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
1722006
Multi terminal binary decision diagrams to represent and analyse continuous time Markov chains
H Hermanns, J Meyer-Kayser, M Siegle
3rd Int. Workshop on the Numerical Solution of Markov Chains, 188-207, 1999
1631999
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
1602005
Comparative branching-time semantics for Markov chains
C Baier, JP Katoen, H Hermanns, V Wolf
Information and computation 200 (2), 149-214, 2005
1602005
Probabilistic reachability for parametric Markov models
EM Hahn, H Hermanns, L Zhang
International Journal on Software Tools for Technology Transfer 13 (1), 3-19, 2011
1502011
On the logical characterisation of performability properties
C Baier, B Haverkort, H Hermanns, JP Katoen
International Colloquium on Automata, Languages, and Programming, 780-792, 2000
1482000
Discrete-time rewards model-checked
S Andova, H Hermanns, JP Katoen
International Conference on Formal Modeling and Analysis of Timed Systems …, 2003
1472003
The system can't perform the operation now. Try again later.
Articles 1–20