Verification of partial-information probabilistic systems using counterexample-guided refinements

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7561 LNCS, Issue , 2012, Pages 333-348

  Giro, Sergio ^a   Rabe, Markus N ^b  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLETE INFORMATION; EXTREMAL; INFORMATION PROBABILISTIC; MODEL CHECKER; OPTIMAL SCHEDULER; ORIGINAL MODEL; PARTIAL INFORMATION; PARTIAL INFORMATION MODEL; PROBABILISTIC SYSTEMS; REACHABILITY; REFINEMENT TECHNIQUES;

INFORMATION THEORY; MODEL CHECKING; PROBABILITY; SCHEDULING;

INFORMATION USE;

EID: 84868231025     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-33386-6_26     Document Type: Conference Paper

References (15)

1. Barthe, G., D'Argenio, P.R., Rezk, T.: Secure information flow by self-composition. In: CSFW, pp. 100-114. IEEE Computer Society (2004)
2. Chatterjee, K., Doyen, L., Henzinger, T.A.: Qualitative Analysis of Partially- Observable Markov Decision Processes. In: Hliněný, P., Kučera, A. (eds.) MFCS 2010. LNCS, vol. 6281, pp. 258-269. Springer, Heidelberg (2010)
3. Cheung, L., Lynch, N.A., Segala, R., Vaandrager, F.W.: Switched pioa: Parallel composition via distributed scheduling. TCS 365(1-2), 83-108 (2006)
4. Ciesinski, F., Baier, C.: Liquor: A tool for qualitative and quantitative linear time analysis of reactive systems. In: QEST, pp. 131-132. IEEE CS (2006)
5. de Alfaro, L., Henzinger, T.A., Jhala, R.: Compositional Methods for Probabilistic Systems. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol. 2154, pp. 351-365. Springer, Heidelberg (2001)
6. Dimitrova, R., Finkbeiner, B.: Abstraction refinement for games with incomplete information. In: FSTTCS. LIPIcs, vol. 2, pp. 175-186 (2008)
7. Forejt, V., Kwiatkowska, M., Norman, G., Parker, D.: Automated Verification Techniques for Probabilistic Systems. In: Bernardo, M., Issarny, V. (eds.) SFM 2011. LNCS, vol. 6659, pp. 53-113. Springer, Heidelberg (2011)
8. Giro, S.: An algorithmic approximation of the infimum reachability probability for probabilistic finite automata. CoRR, abs/1009.3822 (2010)
9. Giro, S.: On the automatic verification of distributed probabilistic automata with partial information. PhD thesis, FaMAF - Universidad Nacional de Córdoba (2010), http://cs.famaf.unc.edu.ar/~sgiro/thesis.pdf
10. Giro, S., D'Argenio, P.R.: Quantitative Model Checking Revisited: Neither Decidable Nor Approximable. In: Raskin, J.-F., Thiagarajan, P.S. (eds.) FORMATS 2007. LNCS, vol. 4763, pp. 179-194. Springer, Heidelberg (2007)
11. Giro, S., D'Argenio, P.R.: On the verification of probabilistic i/o automata with unspecified rates. In: SAC, pp. 582-586. ACM (2009)
12. Kwiatkowska, M., Norman, G., Parker, D.: PRISM 4.0: Verification of Probabilistic Real-Time Systems. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 585-591. Springer, Heidelberg (2011)
13. Madani, O., Hanks, S., Condon, A.: On the undecidability of probabilistic planning and related stochastic optimization problems. Artif. Intell. 147(1-2), 5-34 (2003)
14. Reiter, M.K., Rubin, A.D.: Anonymous web transactions with crowds. Commun. ACM 42(2), 32-38 (1999)
15. van Ditmarsch, H.P., van Eijck, J., Wu,W.: One hundred prisoners and a lightbulb - logic and computation. In: KR (2010)