### Abstract

Original language | English |
---|---|

Title of host publication | FORMATS 2019 |

Editors | É. André, M. Stoelinga |

Publisher | Springer, Cham |

Pages | 181-198 |

Number of pages | 18 |

Volume | 11750 |

ISBN (Electronic) | 978-3-030-29662-9 |

ISBN (Print) | 978-3-030-29661-2 |

DOIs | |

Publication status | Published - 13 Aug 2019 |

Event | 17th International Conference on Formal Modeling and Analysis of Timed Systems - Amsterdam, Netherlands Duration: 27 Aug 2019 → 29 Aug 2019 |

### Publication series

Name | Lecture Notes in Computer Science |
---|---|

Volume | 11750 |

### Conference

Conference | 17th International Conference on Formal Modeling and Analysis of Timed Systems |
---|---|

Abbreviated title | FORMATS 2019 |

Country | Netherlands |

City | Amsterdam |

Period | 27/08/19 → 29/08/19 |

### Fingerprint

### Cite this

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

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

*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

}

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 -