License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC BY-NC-ND 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSTTCS.2009.2337
URN: urn:nbn:de:0030-drops-23374
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2009/2337/
Go to the corresponding LIPIcs Volume Portal

Larsen, Kim G.

Priced Timed Automata: Theory and Tools

pdf-format:
09005.LarsenKim.2337.pdf (0.2 MB)

Abstract

Priced timed automata are emerging as useful formalisms for modeling
and analysing a broad range of resource allocation problems. In
this extended abstract, we highlight recent (un)deci\-dability results
related to priced timed automata as well as point to a number of
open problems.

BibTeX - Entry

@InProceedings{larsen:LIPIcs:2009:2337,
  author =	{Kim G. Larsen},
  title =	{{Priced Timed Automata: Theory and Tools}},
  booktitle =	{IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science},
  pages =	{417--425},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-13-2},
  ISSN =	{1868-8969},
  year =	{2009},
  volume =	{4},
  editor =	{Ravi Kannan and K. Narayan Kumar},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2009/2337},
  URN =		{urn:nbn:de:0030-drops-23374},
  doi =		{10.4230/LIPIcs.FSTTCS.2009.2337},
  annote =	{Keywords: Timed systems, optimal scheduling, priced timed automata, games, model-checking}
}

Keywords: Timed systems, optimal scheduling, priced timed automata, games, model-checking
Collection: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science
Issue Date: 2009
Date of publication: 14.12.2009

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