Effective definability of the reachability relation in timed automata - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Information Processing Letters Année : 2020

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.

Dates et versions

hal-03064610 , version 1 (14-12-2020)

Identifiants

Citer

Martin Fränzle, Karin Quaas, Mahsa Shirmohammadi, James Worrell. Effective definability of the reachability relation in timed automata. Information Processing Letters, 2020, 153, pp.105871. ⟨10.1016/j.ipl.2019.105871⟩. ⟨hal-03064610⟩
11 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More