Discounting the future in systems theory

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2719, Issue , 2003, Pages 1022-1037

  De Alfaro, Luca ^a   Henzinger, Thomas A ^b   Majumdar, Rupak ^b  

^a University of California Santa Cruz   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; DECISION THEORY; MARKOV PROCESSES; SYSTEM THEORY;

CLASSICAL TRANSITION; DEGREE OF PRECISION; DISCOUNT FACTORS; MARKOV DECISION PROCESSES; MULTI-COMPONENT SYSTEMS; PROBABILISTIC SYSTEMS; REGULAR PROPERTIES; SMALL PERTURBATIONS;

GAME THEORY;

EID: 35248855366     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45061-0_79     Document Type: Article

References (35)

1. R. Alur and T.A. Henzinger. Finitary fairness. ACM TOPLAS, 20:1171-1194, 1994.
2. R. Alur, T.A. Henzinger, and O. Kupferman. Alternating-time temporal logic. J. ACM, 49:672-713, 2002.
3. R. Alur, T.A. Henzinger, O. Kupferman, and M.Y. Vardi. Alternating refinement relations. In Concurrency Theory, LNCS 1466, pp. 163-178. Springer, 1998.
4. M.C. Browne, E.M. Clarke, and O. Grumberg. Characterizing finite Kripke structures in propositional temporal logic. Theoretical Computer Science, 59:115-131, 1988.
5. J.R. Büchi. On a decision method in restricted second-order arithmetic. In Congr. Logic, Methodology, and Philosophy of Science 1960, pp. 1-12. Stanford University Press, 1962.
6. L. de Alfaro. Stochastic transition systems. In Concurrency Theory, LNCS 1466, pp. 423-438. Springer, 1998.
7. L. de Alfaro, T.A. Henzinger, and O. Kupferman. Concurrent reachability games. In Symp. Foundations of Computer Science, pp. 564-575. IEEE, 1998.
8. L. de Alfaro, T.A. Henzinger, and R. Majumdar. From verification to control: Dynamic programs for ω-regular objectives. In Symp. Logic in Computer Science, pp. 279-290. IEEE, 2001.
9. L. de Alfaro and R. Majumdar. Quantitative solution of ω-regular games. In Symp. Theory of Computing, pp. 675-683. ACM, 2001.
10. C. Derman. Finite-State Markovian Decision Processes. Academic Press, 1970.
11. J. Desharnais, V. Gupta, R. Jagadeesan, and P. Panangaden. Metrics for labeled Markov systems. In Concurrency Theory, LNCS 1664, pp. 258-273. Springer, 1999.
12. J. Desharnais, V. Gupta, R. Jagadeesan, and P. Panangaden. The metric analogue of weak bisimulation for probabilistic processes. In Symp. Logic in Computer Science, pp. 413-422. IEEE, 2002.
13. E.A. Emerson and C.S. Jutla. Tree automata, μ-calculus and determinacy. In Symp. Foundations of Computer Science, pp. 368-377. IEEE, 1991.
14. E.A. Emerson, C.S. Jutla, and A.P. Sistla. On model checking for fragments of μ-calculus. In Computer-aided Verification, LNCS 697, pp. 385-396. Springer, 1993.
15. E.A. Emerson and C.-L. Lei. Efficient model checking in fragments of the propositional μ-calculus. In Symp. Logic in Computer Science, pp. 267-278. IEEE, June 1986.
16. J. Filar and K. Vrieze. Competitive Markov Decision Processes. Springer, 1997.
17. Y. Gurevich and L. Harrington. Trees, automata, and games. In Symp. Theory of Computing, pp. 60-65. ACM, 1982.
18. C.-C. Jou and S.A. Smolka. Equivalences, congruences, and complete axiomatizations for probabilistic processes. In Concurrency Theory, LNCS 458, pp. 367-383. Springer, 1990.
19. D. Kozen. A probabilistic PDL. In Symp. Theory of Computing, pp. 291-297. ACM, 1983.
20. D. Kozen. Results on the propositional μ-calculus. Theoretical Computer Science, 27:333-354, 1983.
21. Z. Manna and A. Pnueli. A hierarchy of temporal properties. In Symp. Principles of Distributed Computing, pp. 377-408. ACM, 1990.
22. Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer, 1991.
23. A. McIver. Reasoning about efficiency within a probabilitic μ-calculus. Electronic Notes in Theoretical Computer Science, 22, 1999.
24. R. Milner. Operational and algebraic semantics of concurrent processes. In J. van Leeuwen, ed., Handbook of Theoretical Computer Science, vol. B, pp. 1202-1242. Elsevier, 1990.
25. A.W. Mostowski. Regular expressions for infinite trees and a standard form of automata. In Computation Theory, LNCS 208, pp. 157-168. Springer, 1984.
26. G. Owen. Game Theory. Academic Press, 1995.
27. A. Pnueli. The temporal logic of programs. In Symp. Foundations of Computer Science, pp. 46-57. IEEE, 1977.
28. M.O. Rabin. Automata on Infinite Objects and Church's Problem. Conference Series in Mathematics, vol. 13. AMS, 1969.
29. R. Segala. Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, MIT, 1995. Tech. Rep. MIT/LCS/TR-676.
30. R. Segala and N.A. Lynch. Probabilistic simulations for probabilistic processes. In Concurrency Theory, LNCS 836, pp. 481-496. Springer, 1994.
31. L.S. Shapley. Stochastic games. Proc. National Academy of Sciences, 39:1095-1100, 1953.
32. W. Thomas. On the synthesis of strategies in infinite games. In Theoretical Aspects of Computer Science, LNCS 900, pp. 1-13. Springer, 1995.
33. M.Y. Vardi. Automatic verification of probabilistic concurrent finite-state systems. In Symp. Foundations of Computer Science, pp. 327-338. IEEE, 1985.
34. M.Y. Vardi. A temporal fixpoint calculus. In Symp. Principles of Programming Languages, pp. 250-259. ACM, 1988.
35. J. von Neumann and O. Morgenstern. Theory of Games and Economic Behavior. Princeton University Press, 1947.