The Timestamp of Timed Automata

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

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.
Original languageEnglish
Title of host publicationFORMATS 2019
EditorsÉ. André, M. Stoelinga
PublisherSpringer, Cham
Pages181-198
Number of pages18
Volume11750
ISBN (Electronic)978-3-030-29662-9
ISBN (Print)978-3-030-29661-2
DOIs
Publication statusPublished - 13 Aug 2019
Event17th International Conference on Formal Modeling and Analysis of Timed Systems - Amsterdam, Netherlands
Duration: 27 Aug 201929 Aug 2019

Publication series

NameLecture Notes in Computer Science
Volume11750

Conference

Conference17th International Conference on Formal Modeling and Analysis of Timed Systems
Abbreviated titleFORMATS 2019
CountryNetherlands
CityAmsterdam
Period27/08/1929/08/19

Fingerprint

Timestamp
Timed Automata
Suffix
Trace
Partial
Language

Cite this

Rosenmann, A. (2019). The Timestamp of Timed Automata. In É. André, & M. Stoelinga (Eds.), FORMATS 2019 (Vol. 11750, pp. 181-198). (Lecture Notes in Computer Science; Vol. 11750). Springer, Cham. https://doi.org/10.1007/978-3-030-29662-9_11

The Timestamp of Timed Automata. / Rosenmann, Amnon.

FORMATS 2019. ed. / É. André; M. Stoelinga . Vol. 11750 Springer, Cham, 2019. p. 181-198 (Lecture Notes in Computer Science; Vol. 11750).

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

Rosenmann, A 2019, The Timestamp of Timed Automata. in É André & M Stoelinga (eds), FORMATS 2019. vol. 11750, Lecture Notes in Computer Science, vol. 11750, Springer, Cham, pp. 181-198, 17th International Conference on Formal Modeling and Analysis of Timed Systems, Amsterdam, Netherlands, 27/08/19. https://doi.org/10.1007/978-3-030-29662-9_11
Rosenmann A. The Timestamp of Timed Automata. In André É, Stoelinga M, editors, FORMATS 2019. Vol. 11750. Springer, Cham. 2019. p. 181-198. (Lecture Notes in Computer Science). https://doi.org/10.1007/978-3-030-29662-9_11
Rosenmann, Amnon. / The Timestamp of Timed Automata. FORMATS 2019. editor / É. André ; M. Stoelinga . Vol. 11750 Springer, Cham, 2019. pp. 181-198 (Lecture Notes in Computer Science).
@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 = "8",
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",

}

TY - GEN

T1 - The Timestamp of Timed Automata

AU - Rosenmann, Amnon

PY - 2019/8/13

Y1 - 2019/8/13

N2 - 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.

AB - 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.

U2 - 10.1007/978-3-030-29662-9_11

DO - 10.1007/978-3-030-29662-9_11

M3 - Conference contribution

SN - 978-3-030-29661-2

VL - 11750

T3 - Lecture Notes in Computer Science

SP - 181

EP - 198

BT - FORMATS 2019

A2 - André, É.

A2 - Stoelinga , M.

PB - Springer, Cham

ER -