Quantitative solution of omega-regular games

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2001, Pages 675-683

  De Alfaro, L ^a   Majumdar, R ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; LINEAR PROGRAMMING; MARKOV PROCESSES; PROBABILITY DISTRIBUTIONS; SET THEORY;

OMEGA-REGULAR GAMES;

GAME THEORY;

EID: 0034826232     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (30)

1. Solving sequential conditions by finite-state strategies
2. Sequential circuit verification using symbolic model checking
3. Markov decision processes and regular events
4. Concurrent omega-regular games
5. Symbolic model checking of concurrent probabilistic processes using MTBDDs and the Kronecker representation
6. Tree automata, mu-calculus and determinacy (extended abstract)
7. Recursive games
8. Trees, automata, and games
9. Quantitative analysis and model checking
10. A probabilistic PDL
11. Results on the propositional μ-calculus
12. Existence of value and randomized strategies in zero-sum discrete-time stochastic dynamic games
13. The determinacy of Blackwell games
14. Reasoning about efficiency within a probabilitic μ-calculus
15. Infinite games played on finite graphs
16. Probabilistic predicate transformers
17. Regular expressions for infinite trees and a standard form of automata
18. On the existence of stationary optimal strategies
19. Algorithms for stochastic games - A survey
20. Stochastic games
21. On the synthesis of strategies in infinite games
22. The bad match, a total reward stochastic game
23. Automatic verification of probabilistic concurrent finite-state systems