### Abstract

In order to tackle this disturbing problem we show how to effectively construct deterministic timed automata $A_d$ and $B_d$ that are discretizations (digitizations) of the non-deterministic timed automata $A$ and $B$ and differ from the original automata by at most $\frac{1}{6}$ time units on each occurrence of an event.

Language inclusion in the discretized timed automata is decidable and it is also decidable when instead of $L(B)$ we consider $\overline{L(B)}$, the closure of $L(B)$ in the Euclidean topology:

if $L(A_d) \nsubseteq L(B_d)$ then $L(A) \nsubseteq L(B)$ and if

$L(A_d) \subseteq L(B_d)$ then $L(A) \subseteq \overline{L(B)}$.

Moreover, if $L(A_d) \nsubseteq L(B_d)$ we would like to know how far away is $L(A_d)$ from being included in $L(B_d)$. For that matter we define the distance between the languages of timed automata as the limit on how far away a timed trace of one timed automaton can be from the closest timed trace of the other timed automaton.

We then show how one can decide under some restriction whether the distance between two timed automata is finite or infinite.

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

Title of host publication | FORMATS 2019 |

Editors | É André, M. Stoelinga |

Publisher | Springer, Cham |

Pages | 199-215 |

Number of pages | 17 |

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. 199-215). (Lecture Notes in Computer Science; Vol. 11750). Springer, Cham. https://doi.org/10.1007/978-3-030-29662-9_12

**On the Distance Between 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. 199-215, 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_12

}

TY - GEN

T1 - On the Distance Between Timed Automata.

AU - Rosenmann, Amnon

PY - 2019/8/13

Y1 - 2019/8/13

N2 - Some fundamental problems in the class of non-deterministic timed automata, like the problem of inclusion of the language accepted by timed automaton $A$ (e.g., the implementation) in the language accepted by $B$ (e.g., the specification) are, in general, undecidable.In order to tackle this disturbing problem we show how to effectively construct deterministic timed automata $A_d$ and $B_d$ that are discretizations (digitizations) of the non-deterministic timed automata $A$ and $B$ and differ from the original automata by at most $\frac{1}{6}$ time units on each occurrence of an event.Language inclusion in the discretized timed automata is decidable and it is also decidable when instead of $L(B)$ we consider $\overline{L(B)}$, the closure of $L(B)$ in the Euclidean topology:if $L(A_d) \nsubseteq L(B_d)$ then $L(A) \nsubseteq L(B)$ and if $L(A_d) \subseteq L(B_d)$ then $L(A) \subseteq \overline{L(B)}$. Moreover, if $L(A_d) \nsubseteq L(B_d)$ we would like to know how far away is $L(A_d)$ from being included in $L(B_d)$. For that matter we define the distance between the languages of timed automata as the limit on how far away a timed trace of one timed automaton can be from the closest timed trace of the other timed automaton.We then show how one can decide under some restriction whether the distance between two timed automata is finite or infinite.

AB - Some fundamental problems in the class of non-deterministic timed automata, like the problem of inclusion of the language accepted by timed automaton $A$ (e.g., the implementation) in the language accepted by $B$ (e.g., the specification) are, in general, undecidable.In order to tackle this disturbing problem we show how to effectively construct deterministic timed automata $A_d$ and $B_d$ that are discretizations (digitizations) of the non-deterministic timed automata $A$ and $B$ and differ from the original automata by at most $\frac{1}{6}$ time units on each occurrence of an event.Language inclusion in the discretized timed automata is decidable and it is also decidable when instead of $L(B)$ we consider $\overline{L(B)}$, the closure of $L(B)$ in the Euclidean topology:if $L(A_d) \nsubseteq L(B_d)$ then $L(A) \nsubseteq L(B)$ and if $L(A_d) \subseteq L(B_d)$ then $L(A) \subseteq \overline{L(B)}$. Moreover, if $L(A_d) \nsubseteq L(B_d)$ we would like to know how far away is $L(A_d)$ from being included in $L(B_d)$. For that matter we define the distance between the languages of timed automata as the limit on how far away a timed trace of one timed automaton can be from the closest timed trace of the other timed automaton.We then show how one can decide under some restriction whether the distance between two timed automata is finite or infinite.

U2 - 10.1007/978-3-030-29662-9_12

DO - 10.1007/978-3-030-29662-9_12

M3 - Conference contribution

SN - 978-3-030-29661-2

VL - 11750

T3 - Lecture Notes in Computer Science

SP - 199

EP - 215

BT - FORMATS 2019

A2 - André, É

A2 - Stoelinga, M.

PB - Springer, Cham

ER -