On &ohgr;-automata and temporal logic
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
An automata-theoretic approach to linear temporal logic
Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata
Extending lifetime of portable systems by battery scheduling
Proceedings of the conference on Design, automation and test in Europe
Well-structured transition systems everywhere!
Theoretical Computer Science
An analytical high-level battery model for use in energy management of portable electronic systems
Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
Journal of Computer and System Sciences
Flat acceleration in symbolic model checking
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
Energy efficient battery management
IEEE Journal on Selected Areas in Communications
Theoretical Computer Science
Hi-index | 0.00 |
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 {\em 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 $\omega$-regular model-checking 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.