ProbMela and verification of Markov decision processes
暂无分享,去创建一个
[1] Alon Itai,et al. Symmetry breaking in distributed networks , 1990, Inf. Comput..
[2] Doron A. Peled. Partial order reduction: Linear and branching temporal logics and process algebras , 1996, Partial Order Methods in Verification.
[3] Martin L. Puterman,et al. Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .
[4] Paul Gastin,et al. Fast LTL to Büchi Automata Translation , 2001, CAV.
[5] Gerard J. Holzmann,et al. The SPIN Model Checker , 2003 .
[6] Joost-Pieter Katoen,et al. MoDeST - A Modelling and Description Language for Stochastic Timed Systems , 2001, PAPM-PROBMIV.
[7] Patrice Godefroid,et al. On the costs and benefits of using partial-order methods for the verification of concurrent systems (invited paper) , 1997 .
[8] Mihalis Yannakakis,et al. The complexity of probabilistic verification , 1995, JACM.
[9] C. Baier,et al. Partial order reduction for probabilistic systems , 2004 .
[10] Antti Valmari,et al. Stubborn set methods for process algebras , 1997, Partial Order Methods in Verification.
[11] Patrice Godefroid,et al. On the costs and benefits of using partial-order methods for the verification of concurrent systems , 1996, Partial Order Methods in Verification.
[12] Andrea Bianco,et al. Model Checking of Probabalistic and Nondeterministic Systems , 1995, FSTTCS.
[13] Kim G. Larsen,et al. Bisimulation through Probabilistic Testing , 1991, Inf. Comput..
[14] Marta Z. Kwiatkowska,et al. Probabilistic symbolic model checking with PRISM: a hybrid approach , 2004, International Journal on Software Tools for Technology Transfer.
[15] Carroll Morgan,et al. pGCL: formal reasoning for random algorithms , 1998 .
[16] Daniel Lehmann,et al. On the advantages of free choice: a symmetric and fully distributed solution to the dining philosophers problem , 1981, POPL '81.
[17] Christel Baier,et al. PROBMELA: a modeling language for communicating probabilistic processes , 2004, Proceedings. Second ACM and IEEE International Conference on Formal Methods and Models for Co-Design, 2004. MEMOCODE '04..
[18] Marta Z. Kwiatkowska,et al. PRISM: Probabilistic Symbolic Model Checker , 2002, Computer Performance Evaluation / TOOLS.
[19] Gerard J. Holzmann,et al. The SPIN Model Checker - primer and reference manual , 2003 .
[20] Christel Baier,et al. Model checking for a probabilistic branching time logic with fairness , 1998, Distributed Computing.
[21] Luca de Alfaro,et al. Stochastic Transition Systems , 1998, CONCUR.
[22] L. D. Alfaro. The Verification of Probabilistic Systems Under Memoryless Partial-Information Policies is Hard , 1999 .
[23] Christel Baier,et al. Linear Time Logic and Deterministic omega-Automata , 2005 .
[24] Gerard J. Holzmann,et al. Partial Order Methods in Verification , 1997 .
[25] Hans A. Hansson. Time and probability in formal design of distributed systems , 1991, DoCS.
[26] Christel Baier,et al. Partial order reduction for probabilistic systems , 2004, First International Conference on the Quantitative Evaluation of Systems, 2004. QEST 2004. Proceedings..
[27] Stephan Merz,et al. Model Checking , 2000 .
[28] Pierre Wolper,et al. An Automata-Theoretic Approach to Automatic Program Verification (Preliminary Report) , 1986, LICS.
[29] Pedro R. D'Argenio,et al. Partial order reduction on concurrent probabilistic programs , 2004, First International Conference on the Quantitative Evaluation of Systems, 2004. QEST 2004. Proceedings..