Priced Timed Automata: Decidability Results, Algorithms and Applications

Gerd Behrmann; Kim Guldstrand Larsen; Jacob Illum Rasmussen

doi:10.1007/11561163_8

Priced Timed Automata: Decidability Results, Algorithms and Applications

Gerd Behrmann, Kim Guldstrand Larsen, Jacob Illum Rasmussen

Department of Computer Science

Research output: Contribution to book/anthology/report/conference proceeding › Article in proceeding › Research › peer-review

63 Citations (Scopus)

Abstract

This contribution reports on the considerable effort made recently towards extending and applying well-established timed automata technology to optimal scheduling and planning problems. The effort of the authors in this direction has to a large extent been carried out as part of the European projects VHS [22] and AMETIST [17] and are available in the recently released UPPAAL CORA [12], a variant of the real-time verification tool UPPAAL [20,5] specialized for cost-optimal reachability for the extended model of priced timed automata.

Original language	English
Title of host publication	Revised Lectures of the Formal Methods for Components and Objects : Third International Symposium, FMCO 2004, Leiden, The Netherlands, November 2 – 5, 2004
Editors	Frank de Boer, Marcello Bonsangue, Susanne Graf, Willem-Paul de Roever
Publisher	Springer
Publication date	2005
Pages	162-186
ISBN (Electronic)	3540291318
DOIs	https://doi.org/10.1007/11561163_8
Publication status	Published - 2005
Event	Formal Methods for Components and Objects: Third International Symposium, FMCO 2004 - Leiden, Netherlands Duration: 2 Nov 2004 → 5 Nov 2004 Conference number: 3rd

Conference

Conference	Formal Methods for Components and Objects: Third International Symposium, FMCO 2004
Number	3rd
Country/Territory	Netherlands
City	Leiden
Period	02/11/2004 → 05/11/2004

Series	Lecture Notes in Computer Science
Number	3657

Access to Document

10.1007/11561163_8

AUB Link

Search for the material in Aalborg University Library's search engine

Cite this

Behrmann, G., Larsen, K. G., & Rasmussen, J. I. (2005). Priced Timed Automata: Decidability Results, Algorithms and Applications. In F. de Boer, M. Bonsangue, S. Graf, & W-P. de Roever (Eds.), Revised Lectures of the Formal Methods for Components and Objects: Third International Symposium, FMCO 2004, Leiden, The Netherlands, November 2 – 5, 2004 (pp. 162-186). Springer. https://doi.org/10.1007/11561163_8

Behrmann, Gerd ; Larsen, Kim Guldstrand ; Rasmussen, Jacob Illum. / Priced Timed Automata : Decidability Results, Algorithms and Applications. Revised Lectures of the Formal Methods for Components and Objects: Third International Symposium, FMCO 2004, Leiden, The Netherlands, November 2 – 5, 2004. editor / Frank de Boer ; Marcello Bonsangue ; Susanne Graf ; Willem-Paul de Roever. Springer, 2005. pp. 162-186 (Lecture Notes in Computer Science; No. 3657).

@inproceedings{99b2508031c511db8de7000ea68e967b,

title = "Priced Timed Automata: Decidability Results, Algorithms and Applications",

abstract = "This contribution reports on the considerable effort made recently towards extending and applying well-established timed automata technology to optimal scheduling and planning problems. The effort of the authors in this direction has to a large extent been carried out as part of the European projects VHS [22] and AMETIST [17] and are available in the recently released UPPAAL CORA [12], a variant of the real-time verification tool UPPAAL [20,5] specialized for cost-optimal reachability for the extended model of priced timed automata.",

author = "Gerd Behrmann and Larsen, {Kim Guldstrand} and Rasmussen, {Jacob Illum}",

note = "Invited keynote paper; Formal Methods for Components and Objects: Third International Symposium, FMCO 2004 ; Conference date: 02-11-2004 Through 05-11-2004",

year = "2005",

doi = "10.1007/11561163_8",

language = "English",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

number = "3657",

pages = "162--186",

editor = "{de Boer}, Frank and Marcello Bonsangue and Susanne Graf and {de Roever}, Willem-Paul",

booktitle = "Revised Lectures of the Formal Methods for Components and Objects",

address = "Germany",

}

Behrmann, G, Larsen, KG & Rasmussen, JI 2005, Priced Timed Automata: Decidability Results, Algorithms and Applications. in F de Boer, M Bonsangue, S Graf & W-P de Roever (eds), Revised Lectures of the Formal Methods for Components and Objects: Third International Symposium, FMCO 2004, Leiden, The Netherlands, November 2 – 5, 2004. Springer, Lecture Notes in Computer Science, no. 3657, pp. 162-186, Formal Methods for Components and Objects: Third International Symposium, FMCO 2004, Leiden, Netherlands, 02/11/2004. https://doi.org/10.1007/11561163_8

Priced Timed Automata: Decidability Results, Algorithms and Applications. / Behrmann, Gerd; Larsen, Kim Guldstrand; Rasmussen, Jacob Illum.
Revised Lectures of the Formal Methods for Components and Objects: Third International Symposium, FMCO 2004, Leiden, The Netherlands, November 2 – 5, 2004. ed. / Frank de Boer; Marcello Bonsangue; Susanne Graf; Willem-Paul de Roever. Springer, 2005. p. 162-186 (Lecture Notes in Computer Science; No. 3657).

Research output: Contribution to book/anthology/report/conference proceeding › Article in proceeding › Research › peer-review

TY - GEN

T1 - Priced Timed Automata

T2 - Formal Methods for Components and Objects: Third International Symposium, FMCO 2004

AU - Behrmann, Gerd

AU - Larsen, Kim Guldstrand

AU - Rasmussen, Jacob Illum

N1 - Conference code: 3rd

PY - 2005

Y1 - 2005

N2 - This contribution reports on the considerable effort made recently towards extending and applying well-established timed automata technology to optimal scheduling and planning problems. The effort of the authors in this direction has to a large extent been carried out as part of the European projects VHS [22] and AMETIST [17] and are available in the recently released UPPAAL CORA [12], a variant of the real-time verification tool UPPAAL [20,5] specialized for cost-optimal reachability for the extended model of priced timed automata.

AB - This contribution reports on the considerable effort made recently towards extending and applying well-established timed automata technology to optimal scheduling and planning problems. The effort of the authors in this direction has to a large extent been carried out as part of the European projects VHS [22] and AMETIST [17] and are available in the recently released UPPAAL CORA [12], a variant of the real-time verification tool UPPAAL [20,5] specialized for cost-optimal reachability for the extended model of priced timed automata.

U2 - 10.1007/11561163_8

DO - 10.1007/11561163_8

M3 - Article in proceeding

T3 - Lecture Notes in Computer Science

SP - 162

EP - 186

BT - Revised Lectures of the Formal Methods for Components and Objects

A2 - de Boer, Frank

A2 - Bonsangue, Marcello

A2 - Graf, Susanne

A2 - de Roever, Willem-Paul

PB - Springer

Y2 - 2 November 2004 through 5 November 2004

ER -

Behrmann G, Larsen KG, Rasmussen JI. Priced Timed Automata: Decidability Results, Algorithms and Applications. In de Boer F, Bonsangue M, Graf S, de Roever W-P, editors, Revised Lectures of the Formal Methods for Components and Objects: Third International Symposium, FMCO 2004, Leiden, The Netherlands, November 2 – 5, 2004. Springer. 2005. p. 162-186. (Lecture Notes in Computer Science; No. 3657). doi: 10.1007/11561163_8

Priced Timed Automata: Decidability Results, Algorithms and Applications

Abstract

Conference

Access to Document

AUB Link

Fingerprint

Cite this