• Publications
  • Influence
A Theory of Timed Automata
Alur, R. and D.L. Dill, A theory of timed automata, Theoretical Computer Science 126 (1994) 183-235. We propose timed (j&e) automata to model the behavior of real-time systems over time. OurExpand
  • 6,776
  • 843
  • PDF
Alternating-time temporal logic
  • 674
  • 194
The Algorithmic Analysis of Hybrid Systems
We present a general framework for the formal specification and algorithmic analysis of hybrid systems. A hybrid system consists of a discrete program with an analog environment. We model hybridExpand
  • 2,062
  • 167
  • PDF
Alternating-time temporal logic
Temporal logic comes in two varieties: linear-time temporal logic assumes implicit universal quantification over all paths that are generated by system moves; branching-time temporal logic allowsExpand
  • 664
  • 141
  • PDF
Model-Checking in Dense Real-time
Model-checking is a method of verifying concurrent systems in which a state-transition graph model of the system behavior is compared with a temporal logic formula. This paper extends model-checkingExpand
  • 995
  • 133
  • PDF
Visibly pushdown languages
We propose the class of visibly pushdown languages as embeddings of context-free languages that is rich enough to model program analysis questions and yet is tractable and robust like the class ofExpand
  • 522
  • 121
  • PDF
Automata For Modeling Real-Time Systems
To model the behavior of finite-state asynchronous real-time systems we propose the notion of timed Buchi automata (TBA). TBAs are Buchi automata coupled with a mechanism to express constant boundsExpand
  • 1,110
  • 85
Hybrid Automata: An Algorithmic Approach to the Specification and Verification of Hybrid Systems
We introduce the framework of hybrid automata as a model and specification language for hybrid systems. Hybrid automata can be viewed as a generalization of timed automata, in which the behavior ofExpand
  • 1,243
  • 81
  • PDF
The Benefits of Relaxing Punctuality
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,Expand
  • 294
  • 69
Adding nesting structure to words
We propose the model of nested words for representation of data with both a linear ordering and a hierarchically nested matching of items. Examples of data with such dual linear-hierarchicalExpand
  • 355
  • 63
  • PDF