Effective definability of the reachability relation in timed automata
Résumé
We give a new proof of the result of Comon and Jurski that the binary reachability relation of a timed automaton is definable in linear arithmetic.
Mahsa Shirmohammadi : Connectez-vous pour contacter le contributeur
https://hal.science/hal-03064610
Soumis le : lundi 14 décembre 2020-14:32:30
Dernière modification le : vendredi 17 mai 2024-16:10:09