Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Decision Problems for Timed Automata: A Survey ? Rajeev Alur and P. Madhusudan
 

Summary: Decision Problems for Timed Automata: A Survey ?
Rajeev Alur and P. Madhusudan
University of Pennsylvania
Abstract. Finite automata and regular languages have been useful in
a wide variety of problems in computing, communication and control,
including formal modeling and veri cation. Traditional automata do not
admit an explicit modeling of time, and consequently, timed automata [2]
were introduced as a formal notation to model the behavior of real-time
systems. Timed automata accept timed languages consisting of sequences
of events tagged with their occurrence times. Over the years, the formal-
ism has been extensively studied leading to many results establishing
connections to circuits and logic, and much progress has been made in
developing veri cation algorithms, heuristics, and tools. This paper pro-
vides a survey of the theoretical results concerning decision problems
of reachability, language inclusion and language equivalence for timed
automata and its variants, with some new proofs and comparisons. We
conclude with a discussion of some open problems.
1 Timed Automata
A timed automaton is a nite automaton augmented with a nite set of (real-
valued) clocks . The vertices of the automaton are called locations, and edges are

  

Source: Alur, Rajeev - Department of Computer and Information Science, University of Pennsylvania
Parthasarathy, Madhusudan - Department of Computer Science, University of Illinois at Urbana-Champaign

 

Collections: Computer Technologies and Information Sciences