Polytime model checking for timed probabilistic computation tree logic

Acta Informatica

Volumn 35, Issue 8, 1998, Pages 645-661

  Beauquier, Danièle ^a   Slissenko, Anatol ^a  

^a UNIVERSITÉ PARIS EST CRÉTEIL   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032328407     PISSN: 00015903     EISSN: None     Source Type: Journal    
DOI: 10.1007/s002360050136     Document Type: Article

References (22)

1. Alur, R., Courcoubetis, C., Dill, D.: Model-checking for probabilistic real-time systems. In: Automata, Languages and Programming. Proceeding of ICALP'91, Madrid, Spain, July 8-12 1991. (Lect. Notes in Comput. Sci, Vol. 510, pp 115-126) Berlin Heidelberg New York: Springer 1991
2. Aziz, A., Singhal, V., Balarin, F., Brayton, R.K., Sangiovanni-Vincentelli, A.L.: It usually works: the temporal logic of stochastic systems. In Computer Aided Verification. Proceeding of CAV'95, (Lect. Notes in Comput. Sci., Vol. 939, pp 155-165) Berlin Heidelberg New York: Springer 1995
3. Beauquier, D., Burago, D., de Rougemont, M., Slissenko, A.: On the complexity of finite Markov decision processes. Manuscript 1995
4. Beauquier, D., Burago, D., Slissenko, A.: On the complexity of finite memory strategies for Markov decision processes. In: Hájek, P., Wiedermann, J., (eds.) Mathematical Foundation of Computer Science. Proceeding of MFCS'95, (Lect. Notes in Comput. Sci, Vol. 969, pp 191-200) Berlin Heidelberg New York: Springer 1995
5. Bianco, A., de Alfaro, L.: Model checking of probabilistic and nondeterministic systems. In: Thiagarajan, P.S., (ed.) Foundations of Computer Technology and Theoretical Computer Science. Proceeding of the 15th Conference, (Lect. Notes in Comput. Sci., Vol. 1026, pp 499-513) Berlin Heidelberg New York: Springer 1995
6. Burago, D., de Rougemont, M., Slissenko, A.: On the complexity of partially observed Markov decision processes. Theor. Comput. Sci. 157(1):161-183 (1996)
7. Bertsekas, D.P.: Dynamic Programming and Stochastic Control. New York: Academic Press 1976
8. Bemholtz, O., Vardi, M.Y., Wolper, P.: An automata-theoretic approach to branching-time model checking. In: Dill, D., (ed.) Computer Aided Verification. Proceeding of CAV'94, (Lect. Notes in Comput. Sci., Vol. 818, pp 142-155) Berlin Heidelberg New York: Springer 1994
9. Clarke, E., Emerson, E.A., Sistla, A.P.: Automatic verification of finite-state concurrent systems using temporal logic specifications: a practical approach. In: Proc. 10th ACM Symp. on Principles of Programming Languages, pp 117-126, 1983
10. Courcoubetis, C., Yannakakis, M.: Markov decision processes and regular events. In Automata, Languages and Programming. Proceeding of ICALP90, Warwick University, England, July 16-20 1990. (Lect. Notes in Comput. Sci, Vol. 443, pp 336-349) Berlin Heidelberg New York: Springer 1990
11. Courcoubetis, C., Yannakakis, M.: The complexity of probabilistic verification. J. Assoc. Comput. Mach 42(4):857-907 (1995)
12. Emerson, A.: Temporal and modal logic. In: van Leeuwen, J., (ed.) Handbook of Theoretical Computer Science. Vol. B: Formal Models and Sematics, pp 995-1072. Amsterdam: Elsevier 1990
13. Hansson, H.A.: Time and Probability in Formal Design of Distributed Systems. In: Zedan, H. (ed.) Series: "Real Time Safety Critical System", vol. 1. Amsterdam: Elsevier 1994
14. Hansson, H.A., Jonsson, B.: A logic for reasoning about time and probability. Formal Aspects of Computing, 6(5):512-535 (1994)
15. Kallenberg, L.C.M.: Linear programming and finite Markovian control problems. Technical Report 148, Mathematics Centrum Tract, Amsterdam, 1983
16. Kemeny, J.G., Snell, J.L.: Finite Markov Chains. Princeton, NJ: Van Nostad 1960
17. Milner, R.: Communication and Concurrency. Englewood cliffs, NJ: Prentice Hall 1989
18. Milner, R.: Operational and algebraic semantics of concurrent processes. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science. Vol. B: Formal Models and Sematics, pp 1201-1242. Amsterdam: Elsevier 1990
19. Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Englewood Cliffs, NJ: Prentice Hall 1982
20. Prior, A.: Past, Present and Future. Oxford: Clarendon 1967
21. Puterman, M.L.: Markov decision processes. In: Heyman, D.P., Sobel, M.J., (eds) Handbooks in Operations Research and Management Science. Stochastic Models., Vol. 2, pp 331-434. Amsterdam: North Holland 1990
22. Vardi, M.: Automatic verification of probabilistic concurrent finite-state programs. In Proc. IEEE 26th Annu. Symp. on Found. Comput. Sci., pp 327-337, New York 1985