ICAR Research Data Repository for Knowledge Management
DSpace at IIT Bombay
View Archive InfoMetadata
| Field | Value |
| Title | Updatable timed automata with additive and diagonal constraints |
| Names |
MANASA, L
KRISHNA, SN NAGARAJ, K |
| Date Issued | 2008 (iso8601) |
| Abstract | Timed automata [1] are a well established theoretical framework used for modeling real time systems. In this paper, we introduce a class of timed automata with updates of the form x :similar to d-y. We show that these updates preserve the decidability of emptiness of classical timed automata with diagonal constraints for similar to is an element of {=, <, <=}, while emptiness is undecidable for similar to is an element of {>, >=, not equal}. When used along with additive constraints, these updates give decidable emptiness with 2 or lesser number of clocks, and become undecidable for 3 clocks. This provides a partial solution to a long standing open problem [5]. |
| Genre | Proceedings Paper |
| Topic | Systems |
| Identifier | LOGIC AND THEORY OF ALGORITHMS,5028,407-416 |