@inproceedings{8414315545f84caabfc9023f3e635165,
title = "The Timestamp of Timed Automata",
abstract = "Let eNTA be the class of non-deterministic timed automata with silent transitions. Given A∈eNTA , we effectively compute its timestamp: the set of all pairs (time value, action) of all observable timed traces of A. We show that the timestamp is eventually periodic and that one can compute a simple deterministic timed automaton with the same timestamp as that of A. As a consequence, we have a partial method, not bounded by time or number of steps, for the general language non-inclusion problem for eNTA . We also show that the language of A is periodic with respect to suffixes.",
author = "Amnon Rosenmann",
year = "2019",
month = aug,
day = "13",
doi = "10.1007/978-3-030-29662-9_11",
language = "English",
isbn = "978-3-030-29661-2",
volume = "11750",
series = "Lecture Notes in Computer Science",
publisher = "Springer, Cham",
pages = "181--198",
editor = "{\'E}. Andr{\'e} and {Stoelinga }, M.",
booktitle = "FORMATS 2019",
note = "17th International Conference on Formal Modeling and Analysis of Timed Systems, FORMATS 2019 ; Conference date: 27-08-2019 Through 29-08-2019",
}