On probabilistic timed automata

Theoretical Computer Science

Volumn 292, Issue 1, 2003, Pages 65-84

  Beauquier, Danièle ^a  

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

Author keywords

Markov decision process; Model checking; Probabilistic timed automata

Indexed keywords

ALGORITHMS; DECISION THEORY; MARKOV PROCESSES; PROBABILISTIC LOGICS; PROBABILITY DISTRIBUTIONS;

PROBABILISTIC TIMED AUTOMATA;

AUTOMATA THEORY;

EID: 0037427688     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00215-8     Document Type: Article

References (17)

1. Alur R., Courcoubetis C., Dill D. Verifying automata specifications of probabilistic real-time systems. de Bakker J.W., Huizing C., de Roever W.P., Rozenberg G. Real Time: Theory in Practice. Lecture Notes in Computer Science. Vol. 600:1992;28-44 Springer, Berlin.
2. Alur R., Dill D. A theory of timed automata. Theoret. Comput. Sci. 126:1994;183-235.
3. Arnold A. Rational. ω -languages are non-ambiguous Theoret. Comput. Sci. 20:1983;221-223.
4. Bianco A., de Alfaro L. Model checking of probabilistic and nondeterministic systems. Thiagarajan P.S. Foundations of Computer Technology and Theoretical Computer Science, Proc. 15th Conf. Lecture Notes in Computer Science. Vol. 1026:1995;499-513 Springer, Berlin.
5. D. Beauquier, Probabilistic ω -rational events, Technical Report 00-, Université Paris-12, Laboratoire d'Algorithmique, Complexité et Logique, 2000. 9 p., Fundamenta Informaticae 2001, 9pp, submitted for publication.
6. Beauquier D., Burago D., Slissenko A. On the complexity of finite memory policies for markov decision. Wiedermann J. Proc. MFCS'95. Lecture Notes in Computer Science. Vol. 969:1995;191-200 Springer, Berlin.
7. Beauquier D., Slissenko A. Polytime model checking for timed probabilistic systems. Acta Inform. 35:1998;201-212.
8. E. Clarke, E.A. Emerson, A.P. Sistla, Automatic verification of finite-state concurrent systems using temporal logic specifications: a practical approach, in: Proc. 10th ACM Symp. on Principles of Programming Languages, 1983, pp. 117-126.
9. Courcoubetis C., Yannakakis M. The complexity of probabilistic verification. J. Assoc. Comput. Mach. 42(4):1995;857-907.
10. Courcoubetis C., Yannakakis M. Markov decision processes and regular events. IEEE Trans. Automat. Control. 43:1998;1399-1418.
11. Hansson H.A., Jonsson B. A logic for reasoning about time and probability. Formal Aspects Comput. 6(5):1994;512-535.
12. Kwiatkowska M., Norman G., Segala R., Sproston J. Automatic verification of real-time systems with discrete probability distributions. Proc. of the 5th AMAST Workshop on Real-Time and Probabilistic System. Lecture Notes in Computer Science. Vol. 1601:1999;75-95 Springer, Berlin.
13. McNaughton R. Testing and generating infinite sequences by a finite automaton. Inform. Control. 9:1966;521-530.
14. Papadimitriou C.H., Tsitsiklis J.N. The complexity of Markov decision procedures. Math. Oper. Res. 12(3):1987;441-450.
15. M.L. Puterman, Markov decision processes, in: D.P. Heyman, M.J. Sobel (Eds.), Handbooks in Operations Research and Management Science. Stochastic Models, North-Holland, Amsterdam, Vol. 2, 1990, pp. 331-434.
16. M. Vardi, Automatic verification of probabilistic concurrent finite-state programs, in: Proc. IEEE 26th Annu. Symp. on Found. Comput. Sci., New York, 1985, IEEE, pp. 327-337.
17. Vardi M. An automata-theoretic approach to linear temporal logic. Moller F., Birtwistle G. Logic for Concurrency. Structure versus Automata. Lecture notes in Computer Science (Tutorial). Vol. 1043:1996;238-266 Springer, Berlin.