(Enter summary)
Abstract: Discounting the future means that the value, today, of a unit payo# is 1 if
the payo# occurs today, a if it occurs tomorrow, a
if it occurs the day after tomorrow,
and so on, for some real-valued discount factor 0 < a < 1. Discounting (or inflation) is a
key paradigm in economics and has been studied in Markov decision processes as well as
game theory. We submit that discounting also has a natural place in systems engineering:
for nonterminating systems, a potential bug in the far-away... (Update)
Cited by: More
Model Checking Discounted Temporal Properties - de Alfaro, Faella, Henzinger, .. (2003)
(Correct)
Linear and Branching Metrics for Quantitative Transition.. - de Alfaro, Faella.. (2004)
(Correct)
Approximate Reasoning for Real-Time Probabilistic Processes - Gupta, Jagadeesan.. (2006)
(Correct)
Active bibliography (related documents): More All
0.6: Simple Stochastic Parity Games - Chatterjee, Jurdzinski, Henzinger (2003)
(Correct)
0.5: On the Universal and Existential Fragments of the.. - Henzinger, Kupferman..
(Correct)
0.5: Personalization, Verification and Conformance for.. - Baldoni.. (2005)
(Correct)
Similar documents based on text: More All
0.5: Symbolic Algorithms for Infinite-State Games - de Alfaro, Henzinger, Majumdar (2001)
(Correct)
0.4: A Classification of Symbolic Transition Systems - Henzinger, Majumdar (1999)
(Correct)
0.4: Beyond HyTech: Hybrid Systems Analysis Using Interval.. - Henzinger, Horowitz.. (1999)
(Correct)
Related documents from co-citation: More All
3: Time and Probabilities in Formal Design of Distributed Systems (context) - Hansson - 1994
3: Competitive Markov Decision Processes (context) - Filar, Vrieze - 1996
3: The Temporal Logic of Reactive and Concurrent Systems (context) - Manna, Pnueli - 1992
BibTeX entry: (Update)
L. de Alfaro, T.A. Henzinger, and R. Majumdar. Discounting the future in systems theory. In Automata, Languages, and Programming, LNCS 2719, pages 1022-1037. Springer, 2003. http://citeseer.ist.psu.edu/dealfaro03discounting.html More
@misc{ alfaro03discounting,
author = "L. de Alfaro and T. Henzinger and R. Majumdar",
title = "Discounting the future in systems theory",
text = "L. de Alfaro, T.A. Henzinger, and R. Majumdar. Discounting the future in
systems theory. In Automata, Languages, and Programming, LNCS 2719, pages
1022-1037. Springer, 2003.",
year = "2003",
url = "citeseer.ist.psu.edu/dealfaro03discounting.html" }
Citations (may not include all citations):
1180
The Temporal Logic of Reactive and Concurrent Systems: Speci.. (context) - Manna, Pnueli - 1991
539
The temporal logic of programs (context) - Pnueli - 1977
190
Results on the propositional -calculus (context) - Kozen - 1983
182
Theory of Games and Economic Behavior (context) - von Neumann, Morgenstern - 1947
176
a decision method in restricted second-order arithmetic (context) - Buchi - 1962
174
Probabilistic simulations for probabilistic processes
- Segala, Lynch - 1994
128
Automatic verification of probabilistic concurrent finite-st.. (context) - Vardi - 1985
119
Alternating-time temporal logic
- Alur, Henzinger et al. - 2002
90
Characterizing finite Kripke structures in propositional tem.. (context) - Browne, Clarke et al. - 1988
90
Modeling and Verification of Randomized Distributed Real-Tim.. (context) - Segala - 1995
84
Game Theory (context) - Owen - 1995
82
Operational and algebraic semantics of concurrent processes (context) - Milner - 1990
82
Finite-State Markovian Decision Processes (context) - Derman - 1970
78
the synthesis of strategies in infinite games
- Thomas - 1995
69
Competitive Markov Decision Processes (context) - Filar, Vrieze - 1997
66
A temporal fixpoint calculus (context) - Vardi
48
A hierarchy of temporal properties (context) - Manna, Pnueli - 1990
42
Automata on Infinite Objects and Church's Problem (context) - Rabin - 1969
42
and games (context) - Gurevich, Harrington et al. - 1982
39
A probabilistic PDL (context) - Kozen - 1983
39
On model checking for fragments of -calculus
- Emerson, Jutla et al. - 1993
34
Regular expressions for infinite trees and a standard form o.. (context) - Mostowski - 1984
33
calculus and determinacy (context) - Emerson, Jutla - 1991
20
and complete axiomatizations for probabilistic processes (context) - Jou, Smolka et al. - 1990
19
Alternating refinement relations
- Alur, Henzinger et al. - 1998
17
Stochastic transition systems
- de Alfaro - 1998
12
Concurrent reachability games
- de Alfaro, Henzinger et al. - 1998
12
Metrics for labeled Markov systems
- Desharnais, Gupta et al. - 1999
8
The metric analogue of weak bisimulation for probabilistic p..
- Desharnais, Gupta et al. - 2002
6
National Academy of Sciences (context) - Shapley, Proc - 1953
5
Finitary fairness
- Alur, Henzinger - 1994
2
Electronic Notes in Theoretical Computer Science (context) - McIver, ciency et al. - 1999
2
Quantitative solution of #-regular games (context) - de Alfaro, Majumdar - 2001
2
cient model checking in fragments of the propositional -calc.. (context) - Emerson, Lei - 1986
1
From verification to control: Dynamic programs for #-regular.. (context) - de Alfaro, Henzinger et al. - 2001
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC