Priced Timed Automata:  Theory and Tools

Publikation: Bidrag til tidsskriftKonferenceartikel i tidsskriftForskningpeer review

Abstrakt

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.
OriginalsprogEngelsk
TidsskriftDagstuhl Seminar Proceedings
Sider (fra-til)417-425
Antal sider9
ISSN1862-4405
StatusUdgivet - 2009
BegivenhedIARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2009) - Kanpur, Indien
Varighed: 15 dec. 200917 dec. 2009

Konference

KonferenceIARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2009)
LandIndien
ByKanpur
Periode15/12/200917/12/2009

Bibliografisk note

Serie: Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 4, 1868-8969
Volumne: 4

Fingeraftryk Dyk ned i forskningsemnerne om 'Priced Timed Automata:  Theory and Tools'. Sammen danner de et unikt fingeraftryk.

Citationsformater