2020 - ACM Fellow For contributions to model checking of software and probabilistic systems
2013 - Member of Academia Europaea
2009 - ACM Senior Member
Joost-Pieter Katoen mainly investigates Markov chain, Model checking, Theoretical computer science, Probabilistic logic and Algorithm. His Markov chain research integrates issues from Bisimulation, Markov decision process, Reachability and Temporal logic. His work carried out in the field of Model checking brings together such families of science as Binary decision diagram, Dependability, System of linear equations, Formal verification and Key.
His research in Theoretical computer science intersects with topics in Programming language, Formal methods, Markov reward model, Artificial intelligence and Stochastic Petri net. His research in the fields of Probabilistic CTL overlaps with other disciplines such as Bounded function. His Software system research includes themes of Field, Liveness, Debugging and Deadlock.
His primary areas of investigation include Theoretical computer science, Probabilistic logic, Markov chain, Model checking and Algorithm. The various areas that Joost-Pieter Katoen examines in his Theoretical computer science study include Semantics and Operational semantics. His biological study spans a wide range of topics, including Guarded Command Language, Set and Counterexample.
As part of the same scientific family, Joost-Pieter Katoen usually focuses on Markov chain, concentrating on Markov decision process and intersecting with Mathematical optimization. His Model checking study necessitates a more in-depth grasp of Programming language. The Dependability study combines topics in areas such as Formal methods and Correctness.
Joost-Pieter Katoen mainly investigates Probabilistic logic, Theoretical computer science, Markov decision process, Model checking and Markov chain. His work deals with themes such as Algorithm, Semantics, Predicate transformer semantics and Calculus, which intersect with Probabilistic logic. His study in Theoretical computer science is interdisciplinary in nature, drawing from both Class, Correctness, State space, Set and Key.
Joost-Pieter Katoen combines subjects such as Mathematical optimization and Reachability with his study of Markov decision process. In his research on the topic of Model checking, Component and Dependability is strongly related with Fault tree analysis. His Markov chain research is multidisciplinary, incorporating elements of Automaton and Statistical model.
His primary areas of study are Probabilistic logic, Markov decision process, Theoretical computer science, Markov chain and Model checking. His Probabilistic logic study combines topics from a wide range of disciplines, such as Automaton, Soundness, Semantics, Algorithm and Predicate transformer semantics. The Markov decision process study combines topics in areas such as Quadratic programming, Mathematical optimization and Reachability.
Joost-Pieter Katoen has researched Theoretical computer science in several fields, including Strongly connected component, Focus and Graph. The various areas that he examines in his Markov chain study include Guarded Command Language, Modeling language, Statistical model and Stochastic Petri net. His Model checking research incorporates elements of Field, Observability, Probabilistic relevance model, Key and Fault tree analysis.
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.
Principles of Model Checking
Christel Baier;Joost-Pieter Katoen.
Principles of Model Checking (Representation and Mind Series)
Christel Baier;Joost-Pieter Katoen.
Model-checking algorithms for continuous-time Markov chains
C. Baier;B. Haverkort;H. Hermanns;J.-P. Katoen.
IEEE Transactions on Software Engineering (2003)
Model-Based Testing of Reactive Systems, Advanced Lectures
Manfred Broy;Bengt Jonsson;Joost-Pieter Katoen;Martin Leucker.
Lecture Notes in Computer Science (2005)
Validation of Stochastic Systems : A Guide to Current Research
Christel Baier;Boudewijn R. Haverkort;Joost-Pieter Katoen;Holger Hermanns.
The ins and outs of the probabilistic model checker MRMC
Joost-Pieter Katoen;Ivan S. Zapreev;Ernst Moritz Hahn;Holger Hermanns.
Performance Evaluation (2011)
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)
A Markov reward model checker
J.-P. Katoen;M. Khattri;I.S. Zapreevt.
quantitative evaluation of systems (2005)
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.
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: