A game-based abstraction-refinement framework for Markov decision processes-Reference-Cited by-同舟云学术

A game-based abstraction-refinement framework for Markov decision processes

Published:2010-08-03 Issue:3 Volume:36 Page:246-280
ISSN:0925-9856
Container-title:Formal Methods in System Design
language:en
Short-container-title:Form Methods Syst Des

Author:

Kattenbelt Mark,Kwiatkowska Marta,Norman Gethin,Parker David

Publisher

Springer Science and Business Media LLC

Subject

Hardware and Architecture,Theoretical Computer Science,Software

Link

http://link.springer.com/content/pdf/10.1007/s10703-010-0097-6.pdf

Reference44 articles.

1. Baier C, Kwiatkowska M (1998) Model checking for a probabilistic branching time logic with fairness. Distrib Comput 11(3):125–155

2. Bertsekas D, Tsitsiklis J (1991) An analysis of stochastic shortest path problems. Math Oper Res 16(3):580–595

3. Billingsley P (1979) Probability and measure. Wiley, New York

4. Chadha R, Viswanathan M (2010) A counterexample guided abstraction-refinement framework for Markov decision processes. ACM Trans Comput Logic (to appear)

5. Chatterjee K, de Alfaro L, Henzinger T (2004) Trading memory for randomness. In: Proc. 1st int. conf. quantitative evaluation of systems (QEST’04). IEEE Comput. Soc., Los Alamitos, pp 206–217

Cited by 68 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Compositional synthesis of control barrier certificates for networks of stochastic systems against ω-regular specifications;Nonlinear Analysis: Hybrid Systems;2024-02

2. Programmatic Strategy Synthesis: Resolving Nondeterminism in Probabilistic Programs;Proceedings of the ACM on Programming Languages;2024-01-05

3. CTMCs with Imprecisely Timed Observations;Lecture Notes in Computer Science;2024

4. An Enhanced Interface-Based Probabilistic Compositional Verification Approach;Lecture Notes in Computer Science;2023-12-19

5. Efficient Computation of Weapon-Target Assignments Using Abstraction;IEEE Control Systems Letters;2023