{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T19:16:21Z","timestamp":1742930181180,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031274800"},{"type":"electronic","value":"9783031274817"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-27481-7_14","type":"book-chapter","created":{"date-parts":[[2023,3,2]],"date-time":"2023-03-02T14:03:10Z","timestamp":1677765790000},"page":"222-239","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Energy B\u00fcchi Problems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6767-7751","authenticated-orcid":false,"given":"Sven","family":"Dziadek","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9094-7625","authenticated-orcid":false,"given":"Uli","family":"Fahrenberg","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6611-9659","authenticated-orcid":false,"given":"Philipp","family":"Schlehuber-Caissier","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,3,3]]},"reference":[{"issue":"2","key":"14_CR1","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/BFb0031987","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). https:\/\/doi.org\/10.1007\/BFb0031987","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"14_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s00165-020-00521-4","volume":"33","author":"G Bacci","year":"2020","unstructured":"Bacci, G., Bouyer, P., Fahrenberg, U., Larsen, K.G., Markey, N., Reynier, P.-A.: Optimal and robust controller synthesis using energy timed automata with uncertainty. Form. Asp. Comput. 33(1), 3\u201325 (2020). https:\/\/doi.org\/10.1007\/s00165-020-00521-4","journal-title":"Form. Asp. Comput."},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/3-540-45351-2_15","volume-title":"Hybrid Systems: Computation and Control","author":"G Behrmann","year":"2001","unstructured":"Behrmann, G., et al.: Minimum-cost reachability for priced time automata. In: Di Benedetto, M.D., Sangiovanni-Vincentelli, A. (eds.) HSCC 2001. LNCS, vol. 2034, pp. 147\u2013161. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45351-2_15"},{"key":"14_CR4","doi-asserted-by":"publisher","unstructured":"Bellman, R.: On a routing problem. Quart. Appl. Math. 16(1), 87\u201390 (1958). https:\/\/doi.org\/10.1090\/qam\/102435","DOI":"10.1090\/qam\/102435"},{"key":"14_CR5","doi-asserted-by":"publisher","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.S., Heitmeyer, C.L., Gnesi, S., Philippou, A. (eds.) FM, vol. 9995, pp. 559\u2013576. LNCS, Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-48989-6_34","DOI":"10.1007\/978-3-319-48989-6_34"},{"key":"14_CR6","doi-asserted-by":"publisher","unstructured":"Bouyer, P., Fahrenberg, U., Larsen, K.G., Markey, N.: Timed automata with observers under energy constraints. In: Proceedings of the 13th ACM International Conference on Hybrid Systems: Computation and Control, pp. 61\u201370 (2010). https:\/\/doi.org\/10.1145\/1755952.1755963","DOI":"10.1145\/1755952.1755963"},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-540-85778-5_4","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"P Bouyer","year":"2008","unstructured":"Bouyer, P., Fahrenberg, U., Larsen, K.G., Markey, N., Srba, J.: Infinite runs in weighted timed automata with energy constraints. In: Cassez, F., Jard, C. (eds.) FORMATS 2008. LNCS, vol. 5215, pp. 33\u201347. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85778-5_4"},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.peva.2013.11.002","volume":"73","author":"P Bouyer","year":"2014","unstructured":"Bouyer, P., Larsen, K.G., Markey, N.: Lower-bound-constrained runs in weighted timed automata. Perform. Eval. 73, 91\u2013109 (2014). https:\/\/doi.org\/10.1016\/j.peva.2013.11.002","journal-title":"Perform. Eval."},{"key":"14_CR9","doi-asserted-by":"publisher","unstructured":"B\u00fcchi, J.R.: Symposium on decision problems: on a decision method in restricted second order arithmetic. In: Studies in Logic and the Foundations of Mathematics, vol. 44, pp. 1\u201311. Elsevier (1966). https:\/\/doi.org\/10.1016\/S0049-237X(09)70564-6","DOI":"10.1016\/S0049-237X(09)70564-6"},{"key":"14_CR10","unstructured":"Cachera, D., Fahrenberg, U., Legay, A.: An $$\\omega $$-algebra for real-time energy problems. Log. Methods Comput. Sci. 15(2) (2019). https:\/\/lmcs.episciences.org\/5507"},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.tcs.2012.07.038","volume":"458","author":"K Chatterjee","year":"2012","unstructured":"Chatterjee, K., Doyen, L.: Energy parity games. Theor. Comput. Sci. 458, 49\u201360 (2012). https:\/\/doi.org\/10.1016\/j.tcs.2012.07.038","journal-title":"Theor. Comput. Sci."},{"key":"14_CR12","doi-asserted-by":"publisher","unstructured":"Chatterjee, K., Doyen, L., Henzinger, T.A., Raskin, J.F.: Generalized mean-payoff and energy games. In: Lodaya, K., Mahajan, M. (eds.), FSTTCS, vol. 8, pp. 505\u2013516. LIPIcs (2010). https:\/\/doi.org\/10.4230\/LIPIcs.FSTTCS.2010.505","DOI":"10.4230\/LIPIcs.FSTTCS.2010.505"},{"key":"14_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-319-46520-3_8","volume-title":"Automated Technology for Verification and Analysis","author":"A Duret-Lutz","year":"2016","unstructured":"Duret-Lutz, A., Lewkowicz, A., Fauchille, A., Michaud, T., Renault, \u00c9., Xu, L.: Spot 2.0 \u2014 a framework for LTL and $$\\omega $$-automata manipulation. In: Artho, C., Legay, A., Peled, D. (eds.) ATVA 2016. LNCS, vol. 9938, pp. 122\u2013129. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-46520-3_8"},{"issue":"1","key":"14_CR14","doi-asserted-by":"publisher","first-page":"203","DOI":"10.14232\/actacyb.23.1.2017.13","volume":"23","author":"Z \u00c9sik","year":"2017","unstructured":"\u00c9sik, Z., Fahrenberg, U., Legay, A., Quaas, K.: An algebraic approach to energy problems I: $${}^*$$-continuous Kleene $$\\omega $$-algebras. Acta Cyb. 23(1), 203\u2013228 (2017). https:\/\/doi.org\/10.14232\/actacyb.23.1.2017.13","journal-title":"Acta Cyb."},{"issue":"1","key":"14_CR15","doi-asserted-by":"publisher","first-page":"229","DOI":"10.14232\/actacyb.23.1.2017.14","volume":"23","author":"Z \u00c9sik","year":"2017","unstructured":"\u00c9sik, Z., Fahrenberg, U., Legay, A., Quaas, K.: An algebraic approach to energy problems II: the algebra of energy functions. Acta Cyb. 23(1), 229\u2013268 (2017). https:\/\/doi.org\/10.14232\/actacyb.23.1.2017.14","journal-title":"Acta Cyb."},{"key":"14_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-642-23283-1_9","volume-title":"Theoretical Aspects of Computing \u2013 ICTAC 2011","author":"U Fahrenberg","year":"2011","unstructured":"Fahrenberg, U., Juhl, L., Larsen, K.G., Srba, J.: Energy games in multiweighted automata. In: Cerone, A., Pihlajasaari, P. (eds.) ICTAC 2011. LNCS, vol. 6916, pp. 95\u2013115. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23283-1_9"},{"key":"14_CR17","doi-asserted-by":"publisher","unstructured":"Falk, H., Hammond, K., Larsen, K.G., Lisper, B., Petters, S.M.: Code-level timing analysis of embedded software: emsoft\u201912 invited talk session outline. In: Proceedings of the Tenth ACM International Conference on Embedded Software, pp. 163\u2013164 (2012). https:\/\/doi.org\/10.1145\/2380356.2380386","DOI":"10.1145\/2380356.2380386"},{"key":"14_CR18","volume-title":"Network Flow Theory","author":"LR Ford","year":"1956","unstructured":"Ford, L.R.: Network Flow Theory. RAND Corporation, Santa Monica, CA (1956)"},{"key":"14_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-642-24580-0_9","volume-title":"Testing Software and Systems","author":"G Frehse","year":"2011","unstructured":"Frehse, G., Larsen, K.G., Miku\u010dionis, M., Nielsen, B.: Monitoring dynamical signals while testing timed aspects of a system. In: Wolff, B., Za\u00efdi, F. (eds.) ICTSS 2011. LNCS, vol. 7019, pp. 115\u2013130. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24580-0_9"},{"key":"14_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/3-540-44585-4_6","volume-title":"Computer Aided Verification","author":"P Gastin","year":"2001","unstructured":"Gastin, P., Oddoux, D.: Fast LTL to B\u00fcchi automata translation. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 53\u201365. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44585-4_6"},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"Srivathsan, B., Herbreteau, F.: Coarse abstractions make Zeno behaviours difficult to detect. Log. Methods Comput. Sci. 9(1) (2013). https:\/\/lmcs.episciences.org\/882","DOI":"10.2168\/LMCS-9(1:6)2013"},{"key":"14_CR22","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.ic.2016.07.004","volume":"251","author":"F Herbreteau","year":"2016","unstructured":"Herbreteau, F., Srivathsan, B., Walukiewicz, I.: Better abstractions for timed automata. Inf. Comput. 251, 67\u201390 (2016). https:\/\/doi.org\/10.1016\/j.ic.2016.07.004","journal-title":"Inf. Comput."},{"key":"14_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/978-3-540-28644-8_25","volume-title":"CONCUR 2004 - Concurrency Theory","author":"F Laroussinie","year":"2004","unstructured":"Laroussinie, F., Markey, N., Schnoebelen, P.: Model checking timed automata with one or two clocks. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 387\u2013401. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28644-8_25"},{"issue":"1\u20132","key":"14_CR24","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/s100090050010","volume":"1","author":"KG Larsen","year":"1997","unstructured":"Larsen, K.G., Pettersson, P., Yi, W.: UPPAAL in a nutshell. Int. J. Softw. Tools Technol. Trans. 1(1\u20132), 134\u2013152 (1997). https:\/\/doi.org\/10.1007\/s100090050010","journal-title":"Int. J. Softw. Tools Technol. Trans."},{"key":"14_CR25","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., et al.: 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). https:\/\/doi.org\/10.1007\/978-3-642-16561-0_21"},{"key":"14_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1007\/978-3-642-21254-3_36","volume-title":"Language and Automata Theory and Applications","author":"K Quaas","year":"2011","unstructured":"Quaas, K.: On the interval-bound problem for weighted timed automata. In: Dediu, A.-H., Inenaga, S., Mart\u00edn-Vide, C. (eds.) LATA 2011. LNCS, vol. 6638, pp. 452\u2013464. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21254-3_36"},{"key":"14_CR27","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/j.ic.2015.03.001","volume":"241","author":"Y Velner","year":"2015","unstructured":"Velner, Y., Chatterjee, K., Doyen, L., Henzinger, T.A., Rabinovich, A., Raskin, J.F.: The complexity of multi-mean-payoff and multi-energy games. Inf. Comput. 241, 177\u2013196 (2015). https:\/\/doi.org\/10.1016\/j.ic.2015.03.001","journal-title":"Inf. Comput."},{"key":"14_CR28","doi-asserted-by":"publisher","unstructured":"Wolper, P., Vardi, M.Y., Sistla, A.P.: Reasoning about infinite computation paths. In: FOCS, pp. 185\u2013194. IEEE Computer Society (1983). https:\/\/doi.org\/10.1109\/SFCS.1983.51","DOI":"10.1109\/SFCS.1983.51"}],"container-title":["Lecture Notes in Computer Science","Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-27481-7_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,2]],"date-time":"2023-03-02T14:06:52Z","timestamp":1677766012000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-27481-7_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031274800","9783031274817"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-27481-7_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"3 March 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Formal Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"L\u00fcbeck","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 March 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 March 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fm2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/fm2023.isp.uni-luebeck.de\/wordpress\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"95","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"27% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The proceedings also include 7 short industry papers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}