The timestamp of timed automata

DOI10.1007/978-3-030-29662-9_11zbMATH Open1434.68286arXiv1412.5669OpenAlexW2970614654MaRDI QIDQ2176704FDOQ2176704

Authors: Amnon Rosenmann 

Publication date: 5 May 2020

Abstract: Given a member A of the class of non-deterministic timed automata with silent transitions (eNTA), we effectively compute its timestamp: the set of all pairs (time value, action) of all observable timed traces of A, a generalization of the reachability problem. 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.

Full work available at URL: https://arxiv.org/abs/1412.5669

Recommendations

• On the distance between timed automata
• A theory of timed automata
• scientific article; zbMATH DE number 1530301
• When Are Timed Automata Determinizable?
• Undecidability Results for Timed Automata with Silent Transitions

zbMATH Keywords

timed automatareachability problemlanguage inclusiontimestamp

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (4)

• Title not available (Why is that?)
• The efficiency of identifying timed automata and the power of clocks
• Title not available (Why is that?)
• Some combinatorial aspects of time-stamp systems

This page was built for publication: The timestamp of timed automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2176704)