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.
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.
| Originalsprog | Engelsk |
|---|---|
| Tidsskrift | Dagstuhl Seminar Proceedings |
| Sider (fra-til) | 417-425 |
| Antal sider | 9 |
| ISSN | 1862-4405 |
| Status | Udgivet - 2009 |
| Begivenhed | IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2009) - Kanpur, Indien Varighed: 15 dec. 2009 → 17 dec. 2009 |
Konference
| Konference | IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2009) |
|---|---|
| Land/Område | Indien |
| By | Kanpur |
| Periode | 15/12/2009 → 17/12/2009 |
Bibliografisk note
Serie: Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 4, 1868-8969Volumne: 4