Patricia Bouyer
ABSTRACT
In this paper we study one-clock priced timed automata in which prices can grow linearly (dp/dt = k) or exponentially (dp/dt = kp), with discontinuous updates on edges. We propose EXPTIME algorithms to decide the existence of controllers that ensure existence of infinite runs or reachability of some goal location with non-negative observer value all along the run. These algorithms consist in computing the optimal delays that should be elapsed in each location along a run, so that the final observer value is maximized (and never goes below zero).
- R. Alur, C. Courcoubetis, N. Halbwachs, Th. A. Henzinger, P.-H. Ho, X. Nicollin, A. Olivero, J. Sifakis, and S. Yovine. The algorithmic analysis of hybrid systems. Theor. Comp. Science, 138(1):3--34, 1995. Google Scholar
Digital Library
- R. Alur, C. Courcoubetis, and Th. A. Henzinger. Computing accumulated delays in real-time systems. In Proc. 5th Intl Cond. Computer Aided Verification (CAV'93), volume 697 of Lecture Notes in Computer Science, pages 181--193. Springer, 1993. Google ScholarDigital Library
- R. Alur, S. La Torre, and G. J. Pappas. Optimal paths in weighted timed automata. In Proc. 4th Intl Workshop Hybrid Systems: Computation and Control (HSCC'01), volume 2034 of Lecture Notes in Computer Science, pages 49--62. Springer, 2001. Google ScholarDigital Library
- R. Alur, S. La Torre, and G. J. Pappas. Optimal paths in weighted timed automata. Theor. Comp. Science, 318(3):297--322, 2004. Google ScholarDigital Library
- G. Behrmann, A. Fehnker, Th. Hune, K. G. Larsen, P. Pettersson, J. Romijn, and F. Vaandrager. Minimum-cost reachability for priced timed automata. In Proc. 4th Intl Workshop Hybrid Systems: Computation and Control (HSCC'01), volume 2034 of Lecture Notes in Computer Science, pages 147--161. Springer, 2001. Google ScholarDigital Library
- P. Bouyer, U. Fahrenberg, K. G. Larsen, and N. Markey. Timed automata with observers under energy constraints. Research Report LSV-10-01, Lab. Specification & Verification, ENS Cachan, France, 2010.Google ScholarDigital Library
- P. Bouyer, U. Fahrenberg, K. G. Larsen, N. Markey, and J. Srba. Infinite runs in weighted timed automata with energy constraints. In Proc. 6th Intl Conf. Formal Modeling and Analysis of Timed Systems (FORMATS'08), Lecture Notes in Computer Science, pages 33--47. Springer, 2008. Google ScholarDigital Library
- P. Bouyer, K. G. Larsen, N. Markey, and J. I. Rasmussen. Almost optimal strategies in one-clock priced timed automata. In Proc. 26th Conf. Foundations of Software Technology and Theoretical Computer Science (FSTTCS'06), volume 4337 of Lecture Notes in Computer Science, pages 345--356. Springer, 2006. Google ScholarDigital Library
- Y. Kesten, A. Pnueli, J. Sifakis, and S. Yovine. Decidable integration graphs. Inf. and Comp., 150(2):209--243, 1999. Google ScholarDigital Library
- F. Laroussinie, N. Markey, and Ph. Schnoebelen. Model checking timed automata with one or two clocks. In Proc. 15th Intl Conf. Concurrency Theory (CONCUR'04), volume 3170 of Lecture Notes in Computer Science, pages 387--401. Springer, 2004.Google ScholarCross Ref
Index Terms
- Timed automata with observers under energy constraints
Recommendations
On model-checking timed automata with stopwatch observers
In this paper, we study the model-checking problem for weighted timed automata and the weighted CTL logic; we also study the finiteness of bisimulations of weighted timed automata. Weighted timed automata are timed automata extended with costs on both ...
Lower-bound-constrained runs in weighted timed automata
We investigate a number of problems related to infinite runs of weighted timed automata (with a single weight variable), subject to lower-bound constraints on the accumulated weight. Closing an open problem from Bouyer et al. (2008), we show that the ...
Lower-Bound Constrained Runs in Weighted Timed Automata
QEST '12: Proceedings of the 2012 Ninth International Conference on Quantitative Evaluation of SystemsWe investigate a number of problems related to infinite runs of weighted timed automata, subject to lower-bound constraints on the accumulated weight. Closing an open problem from an earlier paper, we show that the existence of an infinite lower-bound-...
Comments