10.4230/LIPICS.FSTTCS.2009.2337
Larsen, Kim G.
Kim G.
Larsen
Priced Timed Automata: Theory and Tools
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
2009
Article
Timed systems
optimal scheduling
priced timed automata
games
model-checking
Kannan, Ravi
Ravi
Kannan
Kumar, K. Narayan
K. Narayan
Kumar
2009
2009-12-14
2009-12-14
2009-12-14
en
urn:nbn:de:0030-drops-23374
10.4230/LIPIcs.FSTTCS.2009
978-3-939897-13-2
1868-8969
10.4230/LIPIcs.FSTTCS.2009
LIPIcs, Volume 4, FSTTCS 2009
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science
2013
4
36
417
425
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Kannan, Ravi
Ravi
Kannan
Kumar, K. Narayan
K. Narayan
Kumar
1868-8969
Leibniz International Proceedings in Informatics (LIPIcs)
2009
4
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
9 pages
167103 bytes
application/pdf
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
info:eu-repo/semantics/openAccess
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.
LIPIcs, Vol. 4, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, pages 417-425