Controller synthesis for probabilistic systems (extended abstract)

IFIP Advances in Information and Communication Technology

Volumn 155, Issue , 2004, Pages 493-506

  Baier, Christel ^a   Größer, Marcus ^a   Leucker, Martin ^b   Bollig, Benedikt ^c   Ciesinski, Frank ^a  

^a UNIVERSITY OF BONN   (Germany)

^b UPPSALA UNIVERSITY   (Sweden)

^c RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; SPECIFICATIONS;

CONTROLLER SYNTHESIS; EXTENDED ABSTRACTS; NON-DETERMINISM; NONDETERMINISTIC CHOICE; PROBABILISTIC COMPUTATION TREE LOGIC; PROBABILISTIC SYSTEMS; SYNTHESIS PROBLEMS; UNPREDICTABLE ENVIRONMENTS;

CONTROLLERS;

EID: 84885948316     PISSN: 18684238     EISSN: None     Source Type: Book Series    
DOI: 10.1007/1-4020-8141-3_38     Document Type: Conference Paper

References (26)

1. Baier, C. and Kwiatkowska, M. (1998). Model checking for a probabilistic branching time logic with fairness. Distributed Computing, 11(3): 125-155.
2. Bianco, A. and De Alfaro, L. (1995). Model checking of probabilistic and non-deterministic systems. In Proc. FST & TCS, LNCS 1026, pages 499-513.
3. Bouyer, P., D'Souza, D., Madhusudan, P., and Petit, A. (2003). Timed control with partial observability. In Proc. CAV LNCS 2725, pages 180-192.
4. Chatterjee, K., Jurdzinski, M., and Henzinger, T. (2003). Simple stochastic parity games. In Proc. CSL LNCS 2803, pages 100-113.
5. Chatterjee, K., Jurdzinski, M., and Henzinger, T. (2004). Quantitative simple stochastic parity games. In Proceedings of the Annual Symposium on Discrete Algorithms (SODA). SIAM.
6. Condon, A. (1992). The complexity of stochastic games. Inf. and Comp., 96:203-224.
7. Condon, A. (1993). On algorithms for simple stochastic games. DIMACS, 13:51-71.
8. de Alfaro, L. (1997). Formal Verification of Probabilistic Systems. PhD thesis, Stanford University. Technical report STAN-CS-TR-98-1601.
9. de Alfaro, L., Faella, M., Henzinger, T., Majumdar, R., and Stoelinga, M. (2003). The element of surprise in timed games. In Proc. CONCUR, LNCS 2761, pages 144-158.
10. de Alfaro, L. and Henzinger, T. (2000). Concurrent omega-regular games. In Proc. LICS, pages 141-154. IEEE Computer Society Press.
11. de Alfaro, L., Henzinger, T., and Kupferman, O. (1998). Concurrent reachability games. In Proc. FOCS, pages 564-575. IEEE Computer Society Press.
12. de Alfaro, L. and Majumdar, R. (2001). Quantitative solution of omega-regular games. In Proc. STOC'01, pages 675-683. ACM Press.
13. Derman, C. (1970). Finite-State Markovian Decision Processes. Academic Press.
14. Emerson, E. and Jutla, C. (1991). Tree automata, mu-calculus and determinacy. In Proc. FOCS, pages 368-377. IEEE Computer Society Press.
15. Emerson, E. A., Jutla, C. S., and Sistla, A. P. (1993). On model-checking for fragments of mucalculus. In Courcoubetis, C., editor, Proc. CAV, LNCS 697, pages 385-396.
16. Filar, J. and Vrieze, K. (1997). Competitive Markov Decision Processes. Springer.
17. Hansson, H. and Jonsson, B. (1994). A logic for reasoning about time and reliability. Formal Aspects of Computing, 6:512-535.
18. Jurdzinski, M. (2000). Small progress for solving parity games. In Proc. STACS, volume 1770 of LNCS, pages 290-301.
19. Jurdzinski, M., Kupferman, O., and Henzinger, T. (2003). Trading probability for fairness. In Proc. CSL, LNCS 2471, pages 292-305.
20. Mitchell, J. C. (2001). Probabilistic polynomial-time process calculus and security protocol analysis. In Proc. ESOP LNCS 2028, pages 23-29.
21. Pnueli, A. and Zuck, L. (1986). Verification of multiprocess probabilistic protocols. Distributed Computing, 1:53-72.
22. Puterman, M. L. (1994). Markov Decision Processes: Discrete Stochastic Dynamic Programming. John Wiley & Sons, Inc., New York, NY.
23. Thomas, W. (1990). Automata on infinite objects. In van Leeuwen, J., editor, Handbook of Theoretical Computer Science, volume B, chapter 4, pages 133-191. Elsevier Science Publishers
24. Thomas, W. (2003). Infinite games and verification In Poc. CAV LNCS 2725, pages 58-64.
25. Vardi, M. Y. (1985). Automatic verification of probabilistic concurrent finite-state programs. In Proc. FOCS, pages 327-338, Portland, Oregon. IEEE.
26. Vöge, J. and Jurdzinski, M. (2000). A discrete strategy improvement algorithm for solving parity games. In Proc. CAV, LNCS 1855, pages 202-215.