H. Hermanns

Publications
Influence

Model-Checking Algorithms for Continuous-Time Markov Chains

C. Baier, B. Haverkort, H. Hermanns, J. Katoen
Computer Science
IEEE Trans. Software Eng.
1 April 2002

This paper introduces a branching temporal logic for expressing real-time probabilistic properties on CTMCs and presents approximate model checking algorithms for this logic. Expand

Interactive Markov Chains

H. Hermanns
Computer Science
Lecture Notes in Computer Science
2002

Interactive Processes.- Markov Chains.- Interactive Markov Chains.- Algebra of Interactive Markov Chains.- Interactive Markov Chains in Practice.- Conclusion.- Proofs for Chapter 3 and Chapter 4.-… Expand

Approximate Symbolic Model Checking of Continuous-Time Markov Chains

C. Baier, J. Katoen, H. Hermanns
Computer Science
CONCUR
24 August 1999

This paper presents a symbolic model checking algorithm for continuous-time Markov chains for an extension of continuous stochastic logic CSL of Aziz et al . Expand

Discrete-Time Rewards Model-Checked

S. Andova, H. Hermanns, J. Katoen
Computer Science
FORMATS
6 September 2003

This paper presents a model-checking approach for analyzing discrete-time Markov reward models. Expand

Model Checking Continuous-Time Markov Chains by Transient Analysis

C. Baier, B. Haverkort, H. Hermanns, J. Katoen
Computer Science
CAV
15 July 2000

We show that model checking probabilistic timing properties of continuous-time Markov chains against continuous stochastic logic can be reduced to the problem of computing transient state probabilities. Expand

Probabilistic CEGAR

H. Hermanns, B. Wachter, L. Zhang
Computer Science
CAV
7 July 2008

We apply counterexample-guided abstraction refinement to the verification of probabilistic systems in the context of predicate abstraction. Expand

Weak Bisimulation for Fully Probabilistic Processes

C. Baier, H. Hermanns
Computer Science, Mathematics
FBT
22 June 1997

In this paper, we introduce weak and branching bisimulation for fully probabilistic systems, transition systems where nondeterministic branching is replaced by Probabilistic branching. Expand

On Probabilistic Automata in Continuous Time

Christian Eisentraut, H. Hermanns, L. Zhang
Mathematics, Computer Science
25th Annual IEEE Symposium on Logic in Computer…
11 July 2010

We develop a compositional behavioural model that integrates a variation of probabilistic automata into a conservative extension of interactive Markov chains. Expand

Comparative branching-time semantics for Markov chains

C. Baier, J. Katoen, H. Hermanns, V. Wolf
Mathematics, Computer Science
Inf. Comput.
1 August 2005

This paper presents various semantics in the branching-time spectrum of discrete-time Markov chains (DTMCs and CTMCs). Expand

Probabilistic Termination: Soundness, Completeness, and Compositionality

Luis María Ferrer Fioriti, H. Hermanns
Computer Science
POPL
14 January 2015

We propose a framework to prove almost sure termination for probabilistic programs with real valued variables. Expand

Recommended Authors