Partial order reduction for probabilistic systems: A revision for distributed schedulers

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

Volumn 5710 LNCS, Issue , 2009, Pages 338-353

  Giro, Sergio ^a   D'Argenio, Pedro R ^a   Ferrer Fioriti, Luis María ^a  

^a UNIVERSIDAD NACIONAL DE CÓRDOBA   (Argentina)

Author keywords

[No Author keywords available]

Indexed keywords

LOCAL INFORMATION; LTL PROPERTY; NON-DETERMINISM; PARTIAL INFORMATION; PARTIAL ORDER REDUCTIONS; PROBABILISTIC MODEL CHECKING; PROBABILISTIC SYSTEMS; REDUCED SYSTEMS; STATE SPACE;

SCHEDULING;

MODEL CHECKING;

EID: 70349862116     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04081-8_23     Document Type: Conference Paper

References (22)

1. Alur, R., Brayton, R.A., Henzinger, T.A., Qadeer, S., Rajamani, S.K.: Partialorder reduction in symbolic state-space exploration. Formal Methods in System Design 18(2), 97-116 (2001)
2. Baier, C., Größer, M., Ciesinski, F.: Partial order reduction for probabilistic systems. In: QEST 2004,Washington, DC, USA, pp. 230-239. IEEE CS, Los Alamitos (2004)
3. Bianco, A., de Alfaro, L.: Model checking of probabilistic and nondeterministic systems. In: Thiagarajan, P.S. (ed.) FSTTCS 1995. LNCS, vol.1026, pp. 288-299. Springer, Heidelberg (1995)
4. Chaum, D.: The dining cryptographers problem: Unconditional sender and recipient untraceability. J. Cryptology 1(1), 65-75 (1988)
5. Cheung, L.: Reconciling Nondeterministic and Probabilistic Choices. PhD thesis, Radboud Universiteit Nijmegen (2006)
6. Cheung, L., Lynch, N., Segala, R., Vaandrager, F.: Switched PIOA: Parallel composition via distributed scheduling. Theor. Comput. Sci. 365(1-2), 83-108 (2006)
7. Ciesinski, F., Baier, C.: LiQuor: A tool for qualitative and quantitative linear time analysis of reactive systems. In: QEST 2006, pp. 131-132. IEEE CS, Los Alamitos (2006)
8. Ciesinski, F., Baier, C., Größer, M., Klein, J.: Reduction techniques for model checking markov decision processes. In: QEST 2008, pp. 45-54 (2008)
9. Clarke, E., Grumberg, O., Peled, D.: Model Checking. MIT Press, Cambridge (2000)
10. D'Argenio, P., Niebert, P.: Partial order reduction on concurrent probabilistic programs. In: QEST 2004, Washington, DC, USA, pp. 240-249. IEEE CS, Los Alamitos (2004)
11. de Alfaro, L.: The verification of probabilistic systems under memoryless partialinformation policies is hard. In: PROBMIV 1999. TR CSR-99-8, University of Birmingham, pp. 19-32 (1999)
12. 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)
13. Giro, S., D'Argenio, P.: 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)
14. Giro, S., D'Argenio, P.: On the expressive power of schedulers in distributed probabilistic systems. In: Proc. of QAPL 2009, York, UK, March 28-29 (2009), Extended version, cs.famaf.unc.edu.ar/~sgiro/QAPL09-ext.pdf
15. Giro, S., D'Argenio, P.: On the verification of probabilistic I/O automata with unspecified rates. In: Proc. of 24th SAC, pp. 582-586. ACM Press, New York (2009)
16. Giro, S., D'Argenio, P.: Partial order reduction for probabilistic systems assuming distributed schedulers. Technical Report Serie A, Inf. 2009/02, FaMAF, UNC (2009), http://cs.famaf.unc.edu.ar/~sgiro/TR-A-INF-09-2.pdf
17. Glabbeek, R.v., Smolka, S., Ste.en, B.: Reactive, generative, and strati.ed models of probabilistic processes. Information and Computation 121, 59-80 (1995)
18. Godefroid, P.: Partial-Order Methods for the Verification of Concurrent Systems. LNCS, vol.1032. Springer, Heidelberg (1996)
19. Jeannet, B., D'Argenio, P., Larsen, K.: Rapture: A tool for verifying Markov Decision Processes. In: Cerna, I. (ed.) Tools Day 2002, Brno, Czech Republic, Technical Report, Faculty of Informatics, Masaryk University Brno (2002)
20. Kwiatkowska, M., Norman, G., Parker, D.: Probabilistic symbolic model checking with PRISM: A hybrid approach. International Journal on Software Tools for Technology Transfer (STTT) 6(2), 128-142 (2004)
21. Segala, R.: Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, Laboratory for Computer Science, MIT (1995)
22. Vardi, M.: Automatic verification of probabilistic concurrent finite state programs. In: Procs. of 26th FOCS, pp. 327-338. IEEE Press, Los Alamitos (1985)