2020 - Fellow of the American Academy of Arts and Sciences
2020 - Member of the National Academy of Sciences
2015 - European Association for Theoretical Computer Science (EATCS) Fellow For fundamental contributions to formal verification and synthesis of computer and biological systems
2012 - Wittgenstein Award
2006 - ACM Fellow For contributions to formal verification and hybrid systems.
2006 - Member of Academia Europaea
His main research concerns Theoretical computer science, Model checking, Algorithm, Programming language and Temporal logic. His studies link State with Theoretical computer science. Thomas A. Henzinger has included themes like Formal verification, Mathematical proof and Hybrid system in his Model checking study.
Thomas A. Henzinger combines subjects such as Control theory and Counterexample with his study of Algorithm. His work on Predicate abstraction, CPAchecker, Specification language and Reactive system as part of general Programming language research is often related to TRACE, thus linking different fields of science. In general Automaton, his work in Hybrid automaton and Automata theory is often linked to Compatibility linking many areas of study.
Thomas A. Henzinger mainly investigates Theoretical computer science, Algorithm, Model checking, Programming language and Discrete mathematics. Many of his studies involve connections with topics such as Finite-state machine and Theoretical computer science. In his research on the topic of Algorithm, Mathematical optimization is strongly related with Markov chain.
The various areas that Thomas A. Henzinger examines in his Model checking study include Formal verification, State space, State and Software verification. His Correctness, Software, Formal specification and Specification language study in the realm of Programming language interacts with subjects such as TRACE. His Discrete mathematics study integrates concerns from other disciplines, such as Nested word, Quantum finite automata, Automata theory and Reachability, Combinatorics.
His scientific interests lie mostly in Automaton, Reachability, Bidding, Mathematical economics and Algorithm. His Automaton research is under the purview of Theoretical computer science. His study in Theoretical computer science is interdisciplinary in nature, drawing from both Computational complexity theory and Scalability.
Within one scientific family, he focuses on topics pertaining to Affine transformation under Reachability, and may sometimes address concerns connected to Series and Hybrid automaton. The study incorporates disciplines such as Dynamical systems theory, Hybrid system, Nonlinear system, Monotonic function and Robustness in addition to Algorithm. His Hybrid system study incorporates themes from Invariant and Gröbner basis.
The scientist’s investigation covers issues in Automaton, Discrete mathematics, Reachability, Markov chain and Algorithm. His research in Automaton intersects with topics in Control engineering, Control theory and Construct. His Reachability study deals with the bigger picture of Theoretical computer science.
His research in Theoretical computer science tackles topics such as Hybrid system which are related to areas like Nonlinear system. His studies in Markov chain integrate themes in fields like Class and Temporal logic. His Abstract interpretation study in the realm of Algorithm connects with subjects such as Convex optimization.
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.
The theory of hybrid automata
logic in computer science (1996)
The algorithmic analysis of hybrid systems
Rajeev Alur;Costas Courcoubetis;Nicolas Halbwachs;Thomas A. Henzinger.
Theoretical Computer Science (1995)
Hybrid Automata: An Algorithmic Approach to the Specification and Verification of Hybrid Systems
Rajeev Alur;Costas Courcoubetis;Thomas A. Henzinger;Pei-Hsin Ho.
Hybrid Systems (1993)
Symbolic model checking for real-time systems
Thomas A. Henzinger;Xavier Nicollin;Joseph Sifakis;Sergio Yovine.
Information & Computation (1994)
Luca de Alfaro;Thomas A. Henzinger.
foundations of software engineering (2001)
Alternating-time temporal logic
Rajeev Alur;Thomas A. Henzinger;Orna Kupferman.
Journal of the ACM (2002)
HYTECH: a model checker for hybrid systems
Thomas A. Henzinger;Pei-Hsin Ho;Howard Wong-Toi.
International Journal on Software Tools for Technology Transfer (1997)
Thomas A. Henzinger;Ranjit Jhala;Rupak Majumdar;Grégoire Sutre.
symposium on principles of programming languages (2002)
What's Decidable about Hybrid Automata?
Thomas A. Henzinger.
Journal of Computer and System Sciences (1998)
Discrete abstractions of hybrid systems
R. Alur;T.A. Henzinger;G. Lafferriere;G.J. Pappas.
Proceedings of the IEEE (2000)
Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking d-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: