2013 - Member of Academia Europaea
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 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.
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.
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.
Model-checking algorithms for continuous-time Markov chains
C. Baier;B. Haverkort;H. Hermanns;J.-P. Katoen.
IEEE Transactions on Software Engineering (2003)
Validation of Stochastic Systems : A Guide to Current Research
Christel Baier;Boudewijn R. Haverkort;Joost-Pieter Katoen;Holger Hermanns.
Interactive Markov chains: and the quest for quantified quality
Lecture Notes in Computer Science (2002)
The ins and outs of the probabilistic model checker MRMC
Joost-Pieter Katoen;Ivan S. Zapreev;Ernst Moritz Hahn;Holger Hermanns.
Performance Evaluation (2011)
Interactive Markov Chains
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)
Process algebra for performance evaluation
Holger Hermanns;Ulrich Herzog;Joost-Pieter Katoen.
Theoretical Computer Science (2002)
Approximate symbolic model checking of continuous-time Markov chains
C. Baier;J.-P. Katoen;H. Hermanns.
Lecture Notes in Computer Science (1999)
Optimal state-space lumping in Markov chains
Salem Derisavi;Holger Hermanns;William H. Sanders.
Information Processing Letters (2003)
Holger Hermanns;Björn Wachter;Lijun Zhang.
computer aided verification (2008)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: