Effective definability of the reachability relation in timed automata
M Fränzle, K Quaas, M Shirmohammadi… - Information Processing …, 2020 - Elsevier
… 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. … In particular, we avoid many
technicalities of [6] by employing a simple “clock memorisation” trick to reduce computation
of the binary reachability relation of a timed automaton to computation of the set of
configurations reachable from a given location starting with the all-zeros clock valuation. We
show how to recover the latter set of configurations as the commutative image of a certain …
of a timed automaton is definable in linear arithmetic. … In particular, we avoid many
technicalities of [6] by employing a simple “clock memorisation” trick to reduce computation
of the binary reachability relation of a timed automaton to computation of the set of
configurations reachable from a given location starting with the all-zeros clock valuation. We
show how to recover the latter set of configurations as the commutative image of a certain …
Showing the best result for this search. See all results