113 citations · 317 across the 70 of their papers we have counts for
Showing 2019 · cs.FLShow all
2 papers · 2 filters
cs.FL2019
Effective Definability of the Reachability Relation in Timed Automata
Martin Fränzle, Karin Quaas, Mahsa Shirmohammadi +1
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.
cs.FL2019★ 14 cited
Termination of Linear Loops over the Integers
Mehran Hosseini, Joël Ouaknine, James Worrell
We consider the problem of deciding termination of single-path while loops with integer variables, affine updates, and affine guard conditions. The question is whether such a loop…