Markov decision processes and deterministic büchi automata

Fundamenta Informaticae

Volumn 50, Issue 1, 2002, Pages 1-13

  Beauquier, Danièle ^a  

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

Author keywords

B chi automata; Markov Decision Processes; Performance evaluation

Indexed keywords

AUTOMATA THEORY; MARKOV PROCESSES; OPTIMIZATION; PROBABILITY; SET THEORY;

MARKOV DECISION PROCESSES;

DECISION THEORY;

EID: 0036502999     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (23)

1. Model-checking for probabilistic real-time systems
2. Verifying automata specifications of probabilistic real-time systems
3. Model checking of probabilistic and nondeterministic systems
4. On the complexity of partially observed Markov decision processes
5. Model-checking for a probabilistic branching time logic with fairness
6. Positive dymanic programming
7. On the complexity of finite memory policies for markov decision
8. Automatic verification of finite-state concurrent systems using temporal logic specifications: A practical approach
9. Markov decision processes and regular events
10. Computing minimum and maximum reachability times in probabilistic systems
11. Non-randomized strategies in stochastic decision processes
12. Complexity issues in Markov decision processes
13. Testing and generating infinite sequences by a finite automaton
14. The complexity of Markov decision procedures
15. Markov decision processes
16. The complementation problem for büchi automata with applications to temporal logic
17. Automata on infinite objects
18. Automatic verification of probabilistic concurrent finite-state programs