The Timestamp of Timed Automata

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

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 Untersuchen Sie die Forschungsthemen von „The Timestamp of Timed Automata“. Zusammen bilden sie einen einzigartigen Fingerprint.

  • Dieses 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