Priced Timed Automata: Theory and Tools

Larsen, Kim G.

doi:10.4230/LIPIcs.FSTTCS.2009.2337

Document

Priced Timed Automata: Theory and Tools

Author Kim G. Larsen

Part of: Volume: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2009)
Part of: Series: Leibniz International Proceedings in Informatics (LIPIcs)
Part of: Conference: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS)
License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
Publication Date: 2009-12-14

PDF

File

PDF

LIPIcs.FSTTCS.2009.2337.pdf

Filesize: 163 kB
9 pages

Document Identifiers

DOI: 10.4230/LIPIcs.FSTTCS.2009.2337
URN: urn:nbn:de:0030-drops-23374

Subject Classification

Keywords

Timed systems
optimal scheduling
priced timed automata
games
model-checking

Metrics

Access Statistics
Total Accesses (updated on a weekly basis)

0

PDF Downloads

0

Metadata Views

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.

Cite As Get BibTex

Kim G. Larsen. Priced Timed Automata: Theory and Tools. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 4, pp. 417-425, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009) https://doi.org/10.4230/LIPIcs.FSTTCS.2009.2337

Author Details

Kim G. Larsen

Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail