Decision Problems for Timed Automata : A Survey

Loading...
Thumbnail Image
Penn collection
Departmental Papers (CIS)
Degree type
Discipline
Subject
Funder
Grant number
License
Copyright date
Distributor
Related resources
Author
Parthasarathy, Madhusudan
Contributor
Abstract

Finite automata and regular languages have been useful in a wide variety of problems in computing, communication and control, including formal modeling and verification. 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 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 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.

Advisor
Date of presentation
2004-09-13
Conference name
Departmental Papers (CIS)
Conference dates
2023-05-16T22:26:52.000
Conference location
Date Range for Data Collection (Start Date)
Date Range for Data Collection (End Date)
Digital Object Identifier
Series name and number
Volume number
Issue number
Publisher
Publisher DOI
Journal Issue
Comments
Postprint version. Proceedings of the 4th International School on Formal Methods for the Design of Computer, Communication and Software Systems : Real Time, 2004 (SFM-RT 2004)
Postprint version. Published in Lecture Notes in Computer Science, Volume 3185, Proceedings of the 4th International School on Formal Methods for the Design of Computer, Communication and Software Systems: Real Time, 2004 (SFM-RT 2004), pages 1-24. Publisher URL: http://dx.doi.org/10.1007/b110123
Recommended citation
Collection