#### Filter Results:

#### Publication Year

1985

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Rajeev Alur, Thomas A. Henzinger, Orna Kupferman
- COMPOS
- 1997

Temporal logic comes in two varieties: <i>linear-time temporal logic</i> assumes implicit universal quantification over all paths that are generated by the execution of a system; <i>branching-time temporal logic</i> allows explicit existential and universal quantification over all paths. We introduce a third, more general variety of temporal logic:… (More)

- Rajeev Alur, Costas Courcoubetis, +6 authors Sergio Yovine
- Theor. Comput. Sci.
- 1995

We present a general framework for the formal speciication and algorithmic analysis of hybrid systems. A hybrid system consists of a discrete program with an analog environment. We model hybrid systems as nite automata equipped with variables that evolve continuously with time according to dynamical laws. For veriication purposes, we restrict ourselves to… (More)

- Thomas A. Henzinger
- LICS
- 1996

- Thomas A. Henzinger, Benjamin Horowitz, Christoph M. Kirsch
- EMSOFT
- 2001

— Giotto provides an abstract programmer's model for the implementation of embedded control systems with hard real-time constraints. A typical control application consists of periodic software tasks together with a mode switching logic for enabling and disabling tasks. Giotto specifies time-triggered sensor readings, task invocations, actuator updates, and… (More)

- Rajeev Alur, Tomás Feder, Thomas A. Henzinger
- J. ACM
- 1991

The most natural, compositional, way of modeling real-time systems uses a dense domain for time. The satistiability of timing constraints that are capable of expressing punctuality in this model, however, is known to be undecidable. We introduce a temporal language that can constrain the time difference between events only with finite, yet arbitrary,… (More)

We describe nite-state programs over real-numbered time in a guarded-command language with real-valued clocks or, equivalently, as nite automata with real-valued clocks. Model checking answers the question which states of a real-time program satisfy a branching-time speciication (given in an extension of CTL with clock variables). We d e v elop an algorithm… (More)

One approach to model checking software is based on the <i>abstract-check-refine</i> paradigm: build an abstract model, then check the desired property, and if the check fails, refine the model and start over. We introduce the concept of <i>lazy abstraction</i> to integrate and optimize the three phases of the abstract-check-refine loop. Lazy abstraction… (More)

A hybrid system is a dynamical system whose behavior exhibits both discrete and continuous change. A hybrid automaton is a mathematical model for hybrid systems, which combines, in a single formalism, automaton transitions for capturing discrete change with diierential equations for capturing continuous change. HyTech is a symbolic model checker for linear… (More)

- Thomas A. Henzinger, Peter W. Kopke, Anuj Puri, Pravin Varaiya
- STOC
- 1995

Hybrid automata model systems with both digital and analog components, such az embedded control programs. Many verification tasks for such programs can be expressed as reachability problems for hybrid au-tomata. By improving on previous decidability and un-decidability results, we identify the precise boundary between decidability and undecidability of the… (More)

We present algorithms for computing similarity relations of labeled graphs. Similarity relations have applications for the refinement and verification of reac-tive systems. For finite graphs, we present an O(mn) algorithm for computing the similarity relation of a graph with n vertices and m edges (assuming m 2 n). For effectively presented infinite graphs,… (More)