-
1
Costs and rewards in priced timed automata
Published 2020“…</p> <p>We develop connections between MPTA and Diophantine equations. Undecidability of the Pareto Domination Problem is shown by reduction from Hilbert's 10th Problem, while decidability for three observers entails translation to a decidable fragment of arithmetic involving quadratic forms.…”
Journal article -
2
Costs and rewards in priced timed automata
Published 2018“…We develop connections between MPTA and Diophantine equations. Undecidability of the Pareto Domination Problem is shown by reduction from Hilbert's 10thProblem, while decidability for three observers is shown by a translation to a fragment of arithmetic involving quadratic forms.…”
Journal article