T. Henzinger

Publications579
h-index101
Citations44,425
Highly Influential Citations3,027
Claim Author Page
Author pages are created from data sourced from our academic publisher partnerships and public sources.

Recommended Authors

  • K. Chatterjee
  • 453 Publications • 10,058 Citations
  • R. Alur
  • 389 Publications • 42,210 Citations
  • O. Kupferman
  • 266 Publications • 10,047 Citations
  • A. Pnueli
  • 385 Publications • 39,653 Citations
  • Publications
  • Influence
Alternating-time temporal logic
TLDR
This work introduces a third, more general variety of temporal logic: alternating-time temporal logic offers selective quantification over those paths that are possible outcomes of games, such as the game in which the system and the environment alternate moves.
View on ACM
The Algorithmic Analysis of Hybrid Systems
View via Publisher
The theory of hybrid automata
  • T. Henzinger
  • Computer Science
    Proceedings 11th Annual IEEE Symposium on Logic…
  • 27 July 1996
TLDR
The goal is to demonstrate that concepts from the theory of discrete concurrent systems can give insights into partly continuous systems, and that methods for the verification of finite-state systems can be used to analyze certain systems with uncountable state spaces.
View on IEEE
Interface automata
TLDR
This work presents a light-weight formalism that captures the temporal aspects of software component interfaces through an automata-based language that supports automatic compatability checks between interface models, and thus constitutes a type system for component interaction.
View on ACM
Lazy abstraction
TLDR
This work presents an algorithm for model checking safety properties using lazy abstraction and describes an implementation of the algorithm applied to C programs and provides sufficient conditions for the termination of the method.
View on ACM
Hybrid Automata: An Algorithmic Approach to the Specification and Verification of Hybrid Systems
TLDR
This work presents two semidecision procedures for verifying safety properties of piecewiselinear hybrid automata, in which all variables change at constant rates, and demonstrates that for many of the typical workshop examples, the procedures do terminate and thus provide an automatic way for verifying their properties.
View via Publisher
The benefits of relaxing punctuality
TLDR
A temporal language is introduced that can constrain the time difference between events only with finite (yet arbitrary) precision and show the resulting logic to be EXPACE-complete, allowing the authors to develop an algorithm for the verification of timing properties of real time systems with a dense semantics.
View on ACM
HYTECH: a model checker for hybrid systems
TLDR
HyTech is a symbolic model checker for linear hybrid automata, a subclass of hybrids that can be analyzed automatically by computing with polyhedral state sets that combines automaton transitions for capturing discrete change with differential equations for capturing continuous change.
View on Springer
Real-time logics: complexity and expressiveness
TLDR
Two elementary real-time temporal logics are identified as expressively complete fragments of the theory of timed state sequences, and these two formalisms are well-suited for the specification and verification of real- time systems.
View on IEEE
Parametric real-time reasoning
TLDR
This work addresses the more realistic and more ambitious problem of deriving symbolic constraints on the timing properties required of real-time systems by introducing parametric timed automata whose transitions are constrained with parametric timing requirements.
View on ACM
...
...