Pareto Optimal Reachability Analysis for Simple Priced Timed Automata

Brian Nielsen; Zhengkui Zhang; Kim Guldstrand Larsen; Gilles Nies; Holger Hermanns; Marvin Stenger

doi:10.1007/978-3-319-68690-5_29

Pareto Optimal Reachability Analysis for Simple Priced Timed Automata

Brian Nielsen, Zhengkui Zhang, Kim Guldstrand Larsen, Gilles Nies, Holger Hermanns, Marvin Stenger

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

4 Citations (Scopus)

Original language	English
Title of host publication	Formal Methods and Software Engineering : 19th International Conference on Formal Engineering Methods, ICFEM 2017, Xi'an, China, November 13-17, 2017, Proceedings
Publisher	Springer
Publication date	2017
Pages	481-495
ISBN (Print)	978-3-319-68689-9
ISBN (Electronic)	978-3-319-68690-5
DOIs	https://doi.org/10.1007/978-3-319-68690-5_29
Publication status	Published - 2017
Event	19th International Conference on Formal Engineering Methods - , China Duration: 13 Nov 2017 → 17 Nov 2017 Conference number: 19

Conference

Conference	19th International Conference on Formal Engineering Methods
Number	19
Country/Territory	China
Period	13/11/2017 → 17/11/2017

Series	Lecture Notes in Computer Science : Programming and Software Engineering
Volume	10610
ISSN	0302-9743

Access to Document

10.1007/978-3-319-68690-5_29

AUB Link

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

Cite this

Nielsen, B., Zhang, Z., Larsen, K. G., Nies, G., Hermanns, H., & Stenger, M. (2017). Pareto Optimal Reachability Analysis for Simple Priced Timed Automata. In Formal Methods and Software Engineering: 19th International Conference on Formal Engineering Methods, ICFEM 2017, Xi'an, China, November 13-17, 2017, Proceedings (pp. 481-495). Springer. https://doi.org/10.1007/978-3-319-68690-5_29

Nielsen, Brian ; Zhang, Zhengkui ; Larsen, Kim Guldstrand et al. / Pareto Optimal Reachability Analysis for Simple Priced Timed Automata. Formal Methods and Software Engineering: 19th International Conference on Formal Engineering Methods, ICFEM 2017, Xi'an, China, November 13-17, 2017, Proceedings. Springer, 2017. pp. 481-495 (Lecture Notes in Computer Science : Programming and Software Engineering, Vol. 10610).

@inproceedings{2966648f8eb0452c91b3140517e577e0,

title = "Pareto Optimal Reachability Analysis for Simple Priced Timed Automata",

author = "Brian Nielsen and Zhengkui Zhang and Larsen, {Kim Guldstrand} and Gilles Nies and Holger Hermanns and Marvin Stenger",

year = "2017",

doi = "10.1007/978-3-319-68690-5_29",

language = "English",

isbn = "978-3-319-68689-9",

series = "Lecture Notes in Computer Science : Programming and Software Engineering",

publisher = "Springer",

pages = "481--495",

booktitle = "Formal Methods and Software Engineering",

address = "Germany",

note = "19th International Conference on Formal Engineering Methods ; Conference date: 13-11-2017 Through 17-11-2017",

}

Nielsen, B, Zhang, Z, Larsen, KG, Nies, G, Hermanns, H & Stenger, M 2017, Pareto Optimal Reachability Analysis for Simple Priced Timed Automata. in Formal Methods and Software Engineering: 19th International Conference on Formal Engineering Methods, ICFEM 2017, Xi'an, China, November 13-17, 2017, Proceedings. Springer, Lecture Notes in Computer Science : Programming and Software Engineering, vol. 10610, pp. 481-495, 19th International Conference on Formal Engineering Methods, China, 13/11/2017. https://doi.org/10.1007/978-3-319-68690-5_29

Pareto Optimal Reachability Analysis for Simple Priced Timed Automata. / Nielsen, Brian; Zhang, Zhengkui; Larsen, Kim Guldstrand et al.
Formal Methods and Software Engineering: 19th International Conference on Formal Engineering Methods, ICFEM 2017, Xi'an, China, November 13-17, 2017, Proceedings. Springer, 2017. p. 481-495 (Lecture Notes in Computer Science : Programming and Software Engineering, Vol. 10610).

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

TY - GEN

T1 - Pareto Optimal Reachability Analysis for Simple Priced Timed Automata

AU - Nielsen, Brian

AU - Zhang, Zhengkui

AU - Larsen, Kim Guldstrand

AU - Nies, Gilles

AU - Hermanns, Holger

AU - Stenger, Marvin

N1 - Conference code: 19

PY - 2017

Y1 - 2017

U2 - 10.1007/978-3-319-68690-5_29

DO - 10.1007/978-3-319-68690-5_29

M3 - Article in proceeding

SN - 978-3-319-68689-9

T3 - Lecture Notes in Computer Science : Programming and Software Engineering

SP - 481

EP - 495

BT - Formal Methods and Software Engineering

PB - Springer

T2 - 19th International Conference on Formal Engineering Methods

Y2 - 13 November 2017 through 17 November 2017

ER -

Nielsen B, Zhang Z, Larsen KG, Nies G, Hermanns H, Stenger M. Pareto Optimal Reachability Analysis for Simple Priced Timed Automata. In Formal Methods and Software Engineering: 19th International Conference on Formal Engineering Methods, ICFEM 2017, Xi'an, China, November 13-17, 2017, Proceedings. Springer. 2017. p. 481-495. (Lecture Notes in Computer Science : Programming and Software Engineering, Vol. 10610). doi: 10.1007/978-3-319-68690-5_29