H-Index & Metrics Top Publications

H-Index & Metrics

Discipline name H-index Citations Publications World Ranking National Ranking
Computer Science H-index 57 Citations 11,790 230 World Ranking 1915 National Ranking 85

Research.com Recognitions

Awards & Achievements

2013 - Member of Academia Europaea

Overview

What is he best known for?

The fields of study he is best known for:

  • Programming language
  • Algorithm
  • Artificial intelligence

The scientist’s investigation covers issues in Markov chain, Theoretical computer science, Model checking, Algorithm and Probabilistic logic. His study in Markov chain is interdisciplinary in nature, drawing from both Process calculus, Markov decision process, Temporal logic and Artificial intelligence. His Theoretical computer science research integrates issues from Computational complexity theory, Formal specification, Dependability and Stochastic Petri net.

He interconnects Markov reward model, Protocol, Binary decision diagram, System of linear equations and Formal verification in the investigation of issues within Model checking. His Algorithm study combines topics in areas such as Continuous-time Markov chain, Static analysis and Hybrid system. His Probabilistic logic study combines topics from a wide range of disciplines, such as Programming language, Bisimulation, Satisfiability, Reachability and Nondeterministic algorithm.

His most cited work include:

  • Model-checking algorithms for continuous-time Markov chains (684 citations)
  • Interactive Markov chains: and the quest for quantified quality (325 citations)
  • Interactive Markov Chains (251 citations)

What are the main themes of his work throughout his whole career to date?

His scientific interests lie mostly in Markov chain, Theoretical computer science, Model checking, Probabilistic logic and Algorithm. The Markov chain study combines topics in areas such as Reachability and Temporal logic. His study in the fields of Automaton, Process calculus and Nondeterministic algorithm under the domain of Theoretical computer science overlaps with other disciplines such as Context.

His Model checking research incorporates elements of Formal verification, Formal methods, Dependability and Artificial intelligence. Holger Hermanns has researched Probabilistic logic in several fields, including Bisimulation, Markov decision process and State space. His biological study focuses on Computation.

He most often published in these fields:

  • Markov chain (38.44%)
  • Theoretical computer science (35.26%)
  • Model checking (32.37%)

What were the highlights of his more recent work (between 2015-2021)?

  • Model checking (32.37%)
  • Markov decision process (17.63%)
  • Theoretical computer science (35.26%)

In recent papers he was focusing on the following fields of study:

Holger Hermanns spends much of his time researching Model checking, Markov decision process, Theoretical computer science, Probabilistic logic and Automaton. Model checking is a primary field of his research addressed under Algorithm. His Markov decision process research is multidisciplinary, incorporating elements of Bisimulation, Interleaving, Mathematical optimization and Interval.

His Theoretical computer science research integrates issues from Probabilistic CTL and Markov chain. Specifically, his work in Markov chain is concerned with the study of Markov model. Many of his research projects under Probabilistic logic are closely connected to Context with Context, tying the diverse disciplines of science together.

Between 2015 and 2021, his most popular works were:

  • The Value of Attack-Defence Diagrams (23 citations)
  • Battery-Aware Scheduling in Low Orbit: The GomX–3 Case (20 citations)
  • PTRebeca: Modeling and analysis of distributed and asynchronous systems (19 citations)

In his most recent research, the most cited papers focused on:

  • Programming language
  • Algorithm
  • Artificial intelligence

His main research concerns Model checking, Markov decision process, Reachability, Theoretical computer science and Automaton. In his papers, Holger Hermanns integrates diverse fields, such as Model checking and Formalism. His Markov decision process research is multidisciplinary, incorporating perspectives in Probabilistic logic, Mathematical optimization, Markov chain and Pareto optimal.

The concepts of his Markov chain study are interwoven with issues in DUAL and Abstraction refinement. His research in the fields of Nondeterministic algorithm overlaps with other disciplines such as Manifold. His study in Automaton is interdisciplinary in nature, drawing from both Scheduling, Formal methods, Attack tree and Distributed computing.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Top Publications

Model-checking algorithms for continuous-time Markov chains

C. Baier;B. Haverkort;H. Hermanns;J.-P. Katoen.
IEEE Transactions on Software Engineering (2003)

962 Citations

Validation of Stochastic Systems : A Guide to Current Research

Christel Baier;Boudewijn R. Haverkort;Joost-Pieter Katoen;Holger Hermanns.
(2004)

500 Citations

Interactive Markov chains: and the quest for quantified quality

Holger Hermanns.
Lecture Notes in Computer Science (2002)

500 Citations

The ins and outs of the probabilistic model checker MRMC

Joost-Pieter Katoen;Ivan S. Zapreev;Ernst Moritz Hahn;Holger Hermanns.
Performance Evaluation (2011)

414 Citations

Interactive Markov Chains

Holger Hermanns.
(2002)

384 Citations

Approximative Symbolic Model Checking of Continuous-Time Markov Chains

Christel Baier;Joost-Pieter Katoen;Joost-Pieter Katoen;Holger Hermanns.
international conference on concurrency theory (1999)

356 Citations

Process algebra for performance evaluation

Holger Hermanns;Ulrich Herzog;Joost-Pieter Katoen.
Theoretical Computer Science (2002)

338 Citations

Approximate symbolic model checking of continuous-time Markov chains

C. Baier;J.-P. Katoen;H. Hermanns.
Lecture Notes in Computer Science (1999)

293 Citations

Optimal state-space lumping in Markov chains

Salem Derisavi;Holger Hermanns;William H. Sanders.
Information Processing Letters (2003)

260 Citations

Model Checking Continuous-Time Markov Chains by Transient Analysis

Christel Baier;Boudewijn R. Haverkort;Holger Hermanns;Joost-Pieter Katoen.
computer aided verification (2000)

223 Citations

Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking h-index is inferred from publications deemed to belong to the considered discipline.

If you think any of the details on this page are incorrect, let us know.

Contact us

Top Scientists Citing Holger Hermanns

Joost-Pieter Katoen

Joost-Pieter Katoen

RWTH Aachen University

Publications: 188

Marta Kwiatkowska

Marta Kwiatkowska

University of Oxford

Publications: 111

David Parker

David Parker

University of Birmingham

Publications: 71

Axel Legay

Axel Legay

Université Catholique de Louvain

Publications: 70

Christel Baier

Christel Baier

TU Dresden

Publications: 66

Kim Guldstrand Larsen

Kim Guldstrand Larsen

Aalborg University

Publications: 64

Gethin Norman

Gethin Norman

University of Glasgow

Publications: 60

Boudewijn R. Haverkort

Boudewijn R. Haverkort

Tilburg University

Publications: 58

Jane Hillston

Jane Hillston

University of Edinburgh

Publications: 47

Krishnendu Chatterjee

Krishnendu Chatterjee

Institute of Science and Technology Austria

Publications: 39

Alessandro Abate

Alessandro Abate

University of Oxford

Publications: 38

Bernd Becker

Bernd Becker

University of Freiburg

Publications: 34

Peter Buchholz

Peter Buchholz

TU Dortmund University

Publications: 27

Luca Cardelli

Luca Cardelli

University of Oxford

Publications: 23

Carlo Ghezzi

Carlo Ghezzi

Politecnico di Milano

Publications: 21

Something went wrong. Please try again later.