The Timestamp of Timed Automata

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 Dive into the research topics of 'The Timestamp of Timed Automata'. Together they form a unique fingerprint.

Cite this