As Cheap as Possible: Efficient Cost-Optimal Reachability for Priced Timed Automat

Kim Guldstrand Larsen; Gerd Behrmann; E. Brinksma; A. Fehnker; T. Hune; P. Pettersson; J. Romijn

As Cheap as Possible: Efficient Cost-Optimal Reachability for Priced Timed Automat

Kim Guldstrand Larsen, Gerd Behrmann, E. Brinksma, A. Fehnker, T. Hune, P. Pettersson, J. Romijn

Department of Computer Science

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

Original language	English
Title of host publication	Computer Aided Verification : 13th International Conference, CAV 2001 Paris, France, July 18 - 22, 2001 : Proceedings : Lecture Notes in Computer Science
Editors	Berry, G. : Comon, H. : Finkel, A. (eds.)
Publisher	IEEE Computer Society Press
Publication date	2001
Edition	2102
Pages	493-505
ISBN (Print)	3540423451
Publication status	Published - 2001
Event	As Cheap as Possible - Duration: 19 May 2010 → …

Conference

Conference	As Cheap as Possible
Period	19/05/2010 → …

AUB Link

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

Cite this

Larsen, K. G., Behrmann, G., Brinksma, E., Fehnker, A., Hune, T., Pettersson, P., & Romijn, J. (2001). As Cheap as Possible: Efficient Cost-Optimal Reachability for Priced Timed Automat. In Berry, G. : Comon, H. : Finkel, A. (eds.) (Ed.), Computer Aided Verification : 13th International Conference, CAV 2001 Paris, France, July 18 - 22, 2001 : Proceedings: Lecture Notes in Computer Science (2102 ed., pp. 493-505). IEEE Computer Society Press.

Larsen, Kim Guldstrand ; Behrmann, Gerd ; Brinksma, E. et al. / As Cheap as Possible : Efficient Cost-Optimal Reachability for Priced Timed Automat. Computer Aided Verification : 13th International Conference, CAV 2001 Paris, France, July 18 - 22, 2001 : Proceedings: Lecture Notes in Computer Science. editor / Berry, G. : Comon, H. : Finkel, A. (eds.). 2102. ed. IEEE Computer Society Press, 2001. pp. 493-505

@inproceedings{f84d2c508ac111dbbb3d000ea68e967b,

title = "As Cheap as Possible: Efficient Cost-Optimal Reachability for Priced Timed Automat",

author = "Larsen, {Kim Guldstrand} and Gerd Behrmann and E. Brinksma and A. Fehnker and T. Hune and P. Pettersson and J. Romijn",

note = "ISSN ; 0302-9743; As Cheap as Possible ; Conference date: 19-05-2010",

year = "2001",

language = "English",

isbn = "3540423451",

pages = "493--505",

editor = "{Berry, G. : Comon, H. : Finkel, A. (eds.)}",

booktitle = "Computer Aided Verification : 13th International Conference, CAV 2001 Paris, France, July 18 - 22, 2001 : Proceedings",

publisher = "IEEE Computer Society Press",

address = "United States",

edition = "2102",

}

Larsen, KG, Behrmann, G, Brinksma, E, Fehnker, A, Hune, T, Pettersson, P & Romijn, J 2001, As Cheap as Possible: Efficient Cost-Optimal Reachability for Priced Timed Automat. in Berry, G. : Comon, H. : Finkel, A. (eds.) (ed.), Computer Aided Verification : 13th International Conference, CAV 2001 Paris, France, July 18 - 22, 2001 : Proceedings: Lecture Notes in Computer Science. 2102 edn, IEEE Computer Society Press, pp. 493-505, As Cheap as Possible, 19/05/2010.

As Cheap as Possible: Efficient Cost-Optimal Reachability for Priced Timed Automat. / Larsen, Kim Guldstrand; Behrmann, Gerd; Brinksma, E. et al.
Computer Aided Verification : 13th International Conference, CAV 2001 Paris, France, July 18 - 22, 2001 : Proceedings: Lecture Notes in Computer Science. ed. / Berry, G. : Comon, H. : Finkel, A. (eds.). 2102. ed. IEEE Computer Society Press, 2001. p. 493-505.

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

TY - GEN

T1 - As Cheap as Possible

T2 - As Cheap as Possible

AU - Larsen, Kim Guldstrand

AU - Behrmann, Gerd

AU - Brinksma, E.

AU - Fehnker, A.

AU - Hune, T.

AU - Pettersson, P.

AU - Romijn, J.

N1 - ISSN ; 0302-9743

PY - 2001

Y1 - 2001

M3 - Article in proceeding

SN - 3540423451

SP - 493

EP - 505

BT - Computer Aided Verification : 13th International Conference, CAV 2001 Paris, France, July 18 - 22, 2001 : Proceedings

A2 - Berry, G. : Comon, H. : Finkel, A. (eds.), null

PB - IEEE Computer Society Press

Y2 - 19 May 2010

ER -

Larsen KG, Behrmann G, Brinksma E, Fehnker A, Hune T, Pettersson P et al. As Cheap as Possible: Efficient Cost-Optimal Reachability for Priced Timed Automat. In Berry, G. : Comon, H. : Finkel, A. (eds.), editor, Computer Aided Verification : 13th International Conference, CAV 2001 Paris, France, July 18 - 22, 2001 : Proceedings: Lecture Notes in Computer Science. 2102 ed. IEEE Computer Society Press. 2001. p. 493-505