{"publication_identifier":{"isbn":["978-145032544-8"]},"author":[{"id":"31E297B6-F248-11E8-B48F-1D18A9856A87","full_name":"Boker, Udi","first_name":"Udi","last_name":"Boker"},{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A"},{"last_name":"Radhakrishna","first_name":"Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","full_name":"Radhakrishna, Arjun"}],"doi":"10.1145/2535838.2535875","page":"595 - 606","_id":"2239","language":[{"iso":"eng"}],"citation":{"mla":"Boker, Udi, et al. <i>Battery Transition Systems</i>. Vol. 49, no. 1, ACM, 2014, pp. 595–606, doi:<a href=\"https://doi.org/10.1145/2535838.2535875\">10.1145/2535838.2535875</a>.","ieee":"U. Boker, T. A. Henzinger, and A. Radhakrishna, “Battery transition systems,” presented at the POPL: Principles of Programming Languages, San Diego, USA, 2014, vol. 49, no. 1, pp. 595–606.","ama":"Boker U, Henzinger TA, Radhakrishna A. Battery transition systems. In: Vol 49. ACM; 2014:595-606. doi:<a href=\"https://doi.org/10.1145/2535838.2535875\">10.1145/2535838.2535875</a>","ista":"Boker U, Henzinger TA, Radhakrishna A. 2014. Battery transition systems. POPL: Principles of Programming Languages vol. 49, 595–606.","apa":"Boker, U., Henzinger, T. A., &#38; Radhakrishna, A. (2014). Battery transition systems (Vol. 49, pp. 595–606). Presented at the POPL: Principles of Programming Languages, San Diego, USA: ACM. <a href=\"https://doi.org/10.1145/2535838.2535875\">https://doi.org/10.1145/2535838.2535875</a>","chicago":"Boker, Udi, Thomas A Henzinger, and Arjun Radhakrishna. “Battery Transition Systems,” 49:595–606. ACM, 2014. <a href=\"https://doi.org/10.1145/2535838.2535875\">https://doi.org/10.1145/2535838.2535875</a>.","short":"U. Boker, T.A. Henzinger, A. Radhakrishna, in:, ACM, 2014, pp. 595–606."},"conference":{"start_date":"2014-01-22","name":"POPL: Principles of Programming Languages","location":"San Diego, USA","end_date":"2014-01-24"},"ec_funded":1,"year":"2014","volume":49,"publist_id":"4722","intvolume":"        49","project":[{"call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"grant_number":"267989","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"date_updated":"2021-01-12T06:56:13Z","month":"01","day":"13","type":"conference","abstract":[{"lang":"eng","text":"The analysis of the energy consumption of software is an important goal for quantitative formal methods. Current methods, using weighted transition systems or energy games, model the energy source as an ideal resource whose status is characterized by one number, namely the amount of remaining energy. Real batteries, however, exhibit behaviors that can deviate substantially from an ideal energy resource. Based on a discretization of a standard continuous battery model, we introduce battery transition systems. In this model, a battery is viewed as consisting of two parts-the available-charge tank and the bound-charge tank. Any charge or discharge is applied to the available-charge tank. Over time, the energy from each tank diffuses to the other tank. Battery transition systems are infinite state systems that, being not well-structured, fall into no decidable class that is known to us. Nonetheless, we are able to prove that the !-regular modelchecking problem is decidable for battery transition systems. We also present a case study on the verification of control programs for energy-constrained semi-autonomous robots."}],"department":[{"_id":"ToHe"}],"issue":"1","publication_status":"published","date_published":"2014-01-13T00:00:00Z","scopus_import":1,"publisher":"ACM","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:56:30Z","oa_version":"None","status":"public","quality_controlled":"1","title":"Battery transition systems"}