Effective Definability of the Reachability Relation in Timed Automata

arxiv: 1903.09773 · v1 · pith:M25THN5Inew · submitted 2019-03-23 · 💻 cs.FL

Martin Fr\"anzle , Karin Quaas , Mahsa Shirmohammadi , James Worrell This is my paper

classification 💻 cs.FL

keywords reachabilityrelationtimedarithmeticautomataautomatonbinarycomon

0 comments

read the original abstract

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.

This paper has not been read by Pith yet.