The Timestamp of Timed Automata

Publikation: Beitrag in Buch/Bericht/KonferenzbandBeitrag in einem KonferenzbandForschungBegutachtung

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.
Originalspracheenglisch
TitelFORMATS 2019
Redakteure/-innenÉ. André, M. Stoelinga
Herausgeber (Verlag)Springer, Cham
Seiten181-198
Seitenumfang18
Band11750
ISBN (elektronisch)978-3-030-29662-9
ISBN (Print)978-3-030-29661-2
DOIs
PublikationsstatusVeröffentlicht - 13 Aug 2019
Veranstaltung17th International Conference on Formal Modeling and Analysis of Timed Systems - Amsterdam, Niederlande
Dauer: 27 Aug 201929 Aug 2019

Publikationsreihe

NameLecture Notes in Computer Science
Band11750

Konferenz

Konferenz17th International Conference on Formal Modeling and Analysis of Timed Systems
KurztitelFORMATS 2019
LandNiederlande
OrtAmsterdam
Zeitraum27/08/1929/08/19

Fingerprint

Timestamp
Timed Automata
Suffix
Trace
Partial
Language

Dies zitieren

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

The Timestamp of Timed Automata. / Rosenmann, Amnon.

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

Publikation: Beitrag in Buch/Bericht/KonferenzbandBeitrag in einem KonferenzbandForschungBegutachtung

Rosenmann, A 2019, The Timestamp of Timed Automata. in É André & M Stoelinga (Hrsg.), FORMATS 2019. Bd. 11750, Lecture Notes in Computer Science, Bd. 11750, Springer, Cham, S. 181-198, Amsterdam, Niederlande, 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, Hrsg., FORMATS 2019. Band 11750. Springer, Cham. 2019. S. 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. Hrsg. / É. André ; M. Stoelinga . Band 11750 Springer, Cham, 2019. S. 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 -