A theory of timed automata

A theory of timed automata (1999)

by Rajeev Alur

Citations:

Datum	Value	Source
TITLE	Timed Automata	SVM HeaderParse 0.2
AUTHOR NAME	Rajeev Alur	SVM HeaderParse 0.2
AUTHOR AFFIL	Department of Computer and Information Science, University of Pennsylvania	SVM HeaderParse 0.2
ABSTRACT	Abstract. Model checking is emerging as a practical tool for automated debugging of complex reactive systems such as embedded controllers and network protocols (see [23] for a survey). Traditional techniques for model checking do not admit an explicit modeling of time, and are thus, unsuitable for analysis of real-time systems whose correctness depends on relative magnitudes of different delays. Consequently, timed automata [7] were introduced as a formal notation to model the behavior of real-time systems. Its definition provides a simple way to annotate state-transition graphs with timing constraints using finitely many real-valued clock variables. Automated analysis of timed automata relies on the construction of a finite quotient of the infinite space of clock valuations. Over the years, the formalism has been extensively studied leading to many results establishing connections to circuits and logic, and much progress has been made in developing verification algorithms, heuristics, and tools. This paper provides a survey of the theory of timed automata, and their role in specification and verification of real-time systems. 1	SVM HeaderParse 0.2
CITATIONS	54 found	ParsCit 1.0