2000 character limit reached
Effective Definability of the Reachability Relation in Timed Automata
Published 23 Mar 2019 in cs.FL | (1903.09773v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.