Discounting in Time

Alur, 1994, A theory of timed automata, Theoretical Computer Science, 126, 183, 10.1016/0304-3975(94)90010-8 Alur, 2004, Optimal paths in weighted timed automata, Theoretical Computer Science, 318, 297, 10.1016/j.tcs.2003.10.038 Behrmann, 2001, Minimum-cost reachability for priced timed automata, 2034, 147 Bouyer, 2004, Staying alive as cheaply as possible, 2993, 203 2008, 5215 Cauchy, 1989 de Alfaro, 2005, Model checking discounted temporal properties, Theoretical Computer Science, 345, 139, 10.1016/j.tcs.2005.07.033 de Alfaro, 2004, Linear and branching metrics for quantitative transition systems, 3142, 97 de Alfaro, 2003, Discounting the future in systems theory, 2719, 1022 Derman, 1970 Fahrenberg, 2009, Discount-optimal infinite runs in priced timed automata, Electronic Notes in Theoretical Computer Science, 239, 179, 10.1016/j.entcs.2009.05.039 Filar, 1997 Henzinger, 2005, Quantifying similarities between timed systems, 3829, 226 Jurdzinski, M. and A. Trivedi, Concavely-priced timed automata, in: Cassez and Jard [5], pp. 48–62 Merlin, 1976, Recoverability of communication protocols: Implications of a theoretical study, IEEE Trans. Comm., COM-24, 1036, 10.1109/TCOM.1976.1093424 Moller, 1990, A temporal calculus of communicating systems, 458, 401 Thrane, C, U. Fahrenberg and K.G. Larsen, Quantitative analysis of weighted transition systems, Journal of Logic and Algebraic Programming (2009), to appear