Author pages are created from data sourced from our academic publisher partnerships and public sources.
Share This Author
Alternating-time temporal logic
- R. Alur, T. Henzinger, O. Kupferman
- Philosophy, Computer ScienceProceedings 38th Annual Symposium on Foundations…
- 8 September 1997
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.
The Algorithmic Analysis of Hybrid Systems
The theory of hybrid automata
- T. Henzinger
- Computer ScienceProceedings 11th Annual IEEE Symposium on Logic…
- 27 July 1996
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.
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.
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.
Hybrid Automata: An Algorithmic Approach to the Specification and Verification of Hybrid Systems
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.
The benefits of relaxing punctuality
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.
HYTECH: a model checker for hybrid systems
- T. Henzinger, Pei-Hsin Ho, H. Wong-Toi
- Computer ScienceInternational Journal on Software Tools for…
- 1 December 1997
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.
Real-time logics: complexity and expressiveness
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.
Parametric real-time reasoning
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.