License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ICALP.2018.125
URN: urn:nbn:de:0030-drops-91297
URL: https://drops.dagstuhl.de/opus/volltexte/2018/9129/
Go to the corresponding LIPIcs Volume Portal


Fränzle, Martin ; Shirmohammadi, Mahsa ; Swaminathan, Mani ; Worrell, James

Costs and Rewards in Priced Timed Automata

pdf-format:
LIPIcs-ICALP-2018-125.pdf (0.5 MB)


Abstract

We consider Pareto analysis of reachable states of multi-priced timed automata (MPTA): timed automata equipped with multiple observers that keep track of costs (to be minimised) and rewards (to be maximised) along a computation. Each observer has a constant non-negative derivative which may depend on the location of the MPTA. We study the Pareto Domination Problem, which asks whether it is possible to reach a target location via a run in which the accumulated costs and rewards Pareto dominate a given objective vector. We show that this problem is undecidable in general, but decidable for MPTA with at most three observers. For MPTA whose observers are all costs or all rewards, we show that the Pareto Domination Problem is PSPACE-complete. We also consider an epsilon-approximate Pareto Domination Problem that is decidable without restricting the number and types of observers. We develop connections between MPTA and Diophantine equations. Undecidability of the Pareto Domination Problem is shown by reduction from Hilbert's 10^{th} Problem, while decidability for three observers is shown by a translation to a fragment of arithmetic involving quadratic forms.

BibTeX - Entry

@InProceedings{frnzle_et_al:LIPIcs:2018:9129,
  author =	{Martin Fr{\"a}nzle and Mahsa Shirmohammadi and Mani Swaminathan and James Worrell},
  title =	{{Costs and Rewards in Priced Timed Automata}},
  booktitle =	{45th International Colloquium on Automata, Languages, and  Programming (ICALP 2018)},
  pages =	{125:1--125:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-076-7},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{107},
  editor =	{Ioannis Chatzigiannakis and Christos Kaklamanis and D{\'a}niel Marx and Donald Sannella},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2018/9129},
  URN =		{urn:nbn:de:0030-drops-91297},
  doi =		{10.4230/LIPIcs.ICALP.2018.125},
  annote =	{Keywords: Priced Timed Automata, Pareto Domination, Diophantine Equations}
}

Keywords: Priced Timed Automata, Pareto Domination, Diophantine Equations
Seminar: 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)
Issue Date: 2018
Date of publication: 29.06.2018


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI