{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T19:19:43Z","timestamp":1742930383373,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319686899"},{"type":"electronic","value":"9783319686905"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-68690-5_29","type":"book-chapter","created":{"date-parts":[[2017,10,9]],"date-time":"2017-10-09T21:14:51Z","timestamp":1507583691000},"page":"481-495","source":"Crossref","is-referenced-by-count":1,"title":["Pareto Optimal Reachability Analysis for Simple Priced Timed Automata"],"prefix":"10.1007","author":[{"given":"Zhengkui","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Brian","family":"Nielsen","sequence":"additional","affiliation":[]},{"given":"Kim Guldstrand","family":"Larsen","sequence":"additional","affiliation":[]},{"given":"Gilles","family":"Nies","sequence":"additional","affiliation":[]},{"given":"Marvin","family":"Stenger","sequence":"additional","affiliation":[]},{"given":"Holger","family":"Hermanns","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,10,11]]},"reference":[{"issue":"2","key":"29_CR1","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R Alur","year":"1994","unstructured":"Alur, R., Dill, D.L.: A theory of timed automata. Theor. Comput. Sci. 126(2), 183\u2013235 (1994)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"29_CR2","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/j.tcs.2003.10.038","volume":"318","author":"R Alur","year":"2004","unstructured":"Alur, R., La Torre, S., Pappas, G.J.: Optimal paths in weighted timed automata. Theor. Comput. Sci. 318(3), 297\u2013322 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"29_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-319-11897-0_10","volume-title":"Advances in Swarm Intelligence","author":"ASA Beegom","year":"2014","unstructured":"Beegom, A.S.A., Rajasree, M.S.: A particle swarm optimization based pareto optimal task scheduling in cloud computing. In: Tan, Y., Shi, Y., Coello, C.A.C. (eds.) ICSI 2014. LNCS, vol. 8795, pp. 79\u201386. Springer, Cham (2014). doi: 10.1007\/978-3-319-11897-0_10"},{"key":"29_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/978-3-540-30080-9_7","volume-title":"Formal Methods for the Design of Real-Time Systems","author":"G Behrmann","year":"2004","unstructured":"Behrmann, G., David, A., Larsen, K.G.: A tutorial on Uppaal. In: Bernardo, M., Corradini, F. (eds.) SFM-RT 2004. LNCS, vol. 3185, pp. 200\u2013236. Springer, Heidelberg (2004). doi: 10.1007\/978-3-540-30080-9_7"},{"key":"29_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/10722167_19","volume-title":"Computer Aided Verification","author":"G Behrmann","year":"2000","unstructured":"Behrmann, G., Hune, T., Vaandrager, F.: Distributing timed model checking \u2014 how the search order matters. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 216\u2013231. Springer, Heidelberg (2000). doi: 10.1007\/10722167_19"},{"key":"29_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/11561163_8","volume-title":"Formal Methods for Components and Objects","author":"G Behrmann","year":"2005","unstructured":"Behrmann, G., Larsen, K.G., Rasmussen, J.I.: Priced timed automata: algorithms and applications. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.) FMCO 2004. LNCS, vol. 3657, pp. 162\u2013182. Springer, Heidelberg (2005). doi: 10.1007\/11561163_8"},{"key":"29_CR7","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/S1567-8326(02)00036-X","volume":"52\u201353","author":"J Bengtsson","year":"2002","unstructured":"Bengtsson, J., Griffioen, W.O.D., Kristoffersen, K.J., Larsen, K.G., Larsson, F., Pettersson, P., Yi, W.: Automated verification of an audio-control protocol using Uppaal. J. Logic Algebraic Program. 52\u201353, 163\u2013181 (2002)","journal-title":"J. Logic Algebraic Program."},{"key":"29_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-540-27755-2_3","volume-title":"Lectures on Concurrency and Petri Nets","author":"J Bengtsson","year":"2004","unstructured":"Bengtsson, J., Yi, W.: Timed automata: semantics, algorithms and tools. In: Desel, J., Reisig, W., Rozenberg, G. (eds.) ACPN 2003. LNCS, vol. 3098, pp. 87\u2013124. Springer, Heidelberg (2004). doi: 10.1007\/978-3-540-27755-2_3"},{"key":"29_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1007\/978-3-319-48989-6_34","volume-title":"FM 2016: Formal Methods","author":"M Bisgaard","year":"2016","unstructured":"Bisgaard, M., Gerhardt, D., Hermanns, H., Kr\u010d\u00e1l, J., Nies, G., Stenger, M.: Battery-aware scheduling in low orbit: the GomX\u20133 case. In: Fitzgerald, J., Heitmeyer, C., Gnesi, S., Philippou, A. (eds.) FM 2016. LNCS, vol. 9995, pp. 559\u2013576. Springer, Cham (2016). doi: 10.1007\/978-3-319-48989-6_34"},{"key":"29_CR10","unstructured":"Boudjadar, A., Kim, J.H., Larsen, K.G., Nyman, U.: Compositional schedulability analysis of an avionics system using UPPAAL. In: ICAASE, CEUR Workshop Proceedings, vol. 1294, pp. 140\u2013147. CEUR-WS.org (2014)"},{"key":"29_CR11","doi-asserted-by":"crossref","unstructured":"Bozga, M., Daws, C., Maler, O., Olivero, A., Tripakis, S., Yovine, S.: Kronos: a model-checking tool for real-time systems. In: CAV, pp. 546\u2013550 (1998)","DOI":"10.1007\/BFb0028779"},{"key":"29_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/978-3-540-30206-3_20","volume-title":"Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems","author":"T Brihaye","year":"2004","unstructured":"Brihaye, T., Bruy\u00e8re, V., Raskin, J.-F.: Model-checking for weighted timed automata. In: Lakhnech, Y., Yovine, S. (eds.) FORMATS\/FTRTFT -2004. LNCS, vol. 3253, pp. 277\u2013292. Springer, Heidelberg (2004). doi: 10.1007\/978-3-540-30206-3_20"},{"key":"29_CR13","doi-asserted-by":"crossref","unstructured":"Fehnker, A.: Scheduling a steel plant with timed automata. In: RTCSA, pp. 280\u2013286. IEEE Computer Society (1999)","DOI":"10.1109\/RTCSA.1999.811256"},{"key":"29_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/978-3-642-33386-6_25","volume-title":"Automated Technology for Verification and Analysis","author":"V Forejt","year":"2012","unstructured":"Forejt, V., Kwiatkowska, M., Parker, D.: Pareto curves for probabilistic model checking. In: Chakraborty, S., Mukund, M. (eds.) ATVA 2012. LNCS, pp. 317\u2013332. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-33386-6_25"},{"issue":"3\u20135","key":"29_CR15","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/S0378-4754(02)00019-8","volume":"60","author":"I Kacem","year":"2002","unstructured":"Kacem, I., Hammadi, S., Borne, P.: Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic. Math. Comput. Simul. 60(3\u20135), 245\u2013276 (2002)","journal-title":"Math. Comput. Simul."},{"key":"29_CR16","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1016\/j.engappai.2016.03.004","volume":"53","author":"M Khalesian","year":"2016","unstructured":"Khalesian, M., Delavar, M.R.: Wireless sensors deployment optimization using a constrained pareto-based multi-objective evolutionary approach. Eng. Appl. AI 53, 126\u2013139 (2016)","journal-title":"Eng. Appl. AI"},{"key":"29_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/3-540-60249-6_41","volume-title":"Fundamentals of Computation Theory","author":"KG Larsen","year":"1995","unstructured":"Larsen, K.G., Pettersson, P., Yi, W.: Model-checking for real-time systems. In: Reichel, H. (ed.) FCT 1995. LNCS, vol. 965, pp. 62\u201388. Springer, Heidelberg (1995). doi: 10.1007\/3-540-60249-6_41"},{"issue":"2\u20133","key":"29_CR18","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/j.tcs.2007.09.021","volume":"390","author":"KG Larsen","year":"2008","unstructured":"Larsen, K.G., Rasmussen, J.I.: Optimal reachability for multi-priced timed automata. Theor. Comput. Sci. 390(2\u20133), 197\u2013213 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"29_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-3-642-16561-0_21","volume-title":"Leveraging Applications of Formal Methods, Verification, and Validation","author":"M Miku\u010dionis","year":"2010","unstructured":"Miku\u010dionis, M., Larsen, K.G., Rasmussen, J.I., Nielsen, B., Skou, A., Palm, S.U., Pedersen, J.S., Hougaard, P.: Schedulability analysis using Uppaal: Herschel-Planck case study. In: Margaria, T., Steffen, B. (eds.) ISoLA 2010. LNCS, vol. 6416, pp. 175\u2013190. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-16561-0_21"},{"key":"29_CR20","doi-asserted-by":"crossref","first-page":"41","DOI":"10.4204\/EPTCS.13.4","volume":"13","author":"M Schuts","year":"2009","unstructured":"Schuts, M., Zhu, F., Heidarian, F., Vaandrager, F.W.: Modelling clock synchronization in the chess gmac WSN protocol. QFM. EPTCS 13, 41\u201354 (2009)","journal-title":"QFM. EPTCS"}],"container-title":["Lecture Notes in Computer Science","Formal Methods and Software Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-68690-5_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,4]],"date-time":"2019-10-04T07:26:29Z","timestamp":1570173989000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-68690-5_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319686899","9783319686905"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-68690-5_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}