On the verification of probabilistic I/O automata with unspecified rates

Proceedings of the ACM Symposium on Applied Computing

Volumn , Issue , 2009, Pages 582-586

  Giro, Sergio ^a   D'Argenio, Pedro R ^a  

^a UNIVERSIDAD NACIONAL DE CÓRDOBA   (Argentina)

Author keywords

Distributed systems; Model checking; Probabilistic automata

Indexed keywords

DELAY PARAMETERS; DISTRIBUTED SYSTEMS MODEL; EXACT COMPUTATIONS; FAIR SERVICE; I/O AUTOMATA; MARKOV DECISION PROCESSES; NON-TRIVIAL; OVER-ESTIMATION; PROBABILISTIC AUTOMATA; REACHABILITY; SIMPLE PROTOCOL; SUPREMUM;

COMPUTER SCIENCE; ESTIMATION; MARKOV PROCESSES; MOBILE TELECOMMUNICATION SYSTEMS; ROBOTS; TRANSLATION (LANGUAGES);

MODEL CHECKING;

EID: 70349885789     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1529282.1529406     Document Type: Conference Paper

References (12)

1. A. Bianco and L. de Alfaro. Model checking of probabilistic and nondeterministic systems. In FSTTCS '95, pages 288-299. Springer, 1995.
2. L. Cheung. Reconciling Nondeterministic and Probabilistic Choices. PhD thesis, Radboud Universiteit Nijmegen, 2006.
3. L. de Alfaro. The verification of probabilistic systems under memoryless partial-information policies is hard. In Proc. of PROBMIV 99. Technical Report CSR-99-8, pages 19-32. University of Birmingham, 1999.
4. L. de Alfaro, T. A. Henzinger, and R. Jhala. Compositional methods for probabilistic systems. In CONCUR 01, pages 351-365. Springer, 2001.
5. S. Giro and P. R. D'Argenio. Quantitative model checking revisited: neither decidable nor approximable. In FORMATS '07, pages 179-194. Springer, 2007.
6. R. v. Glabbeek, S. Smolka, and B. Steffen. Reactive, generative, and stratified models of probabilistic processes. Inf. & Comp., 121:59-80, 1995.
7. A. Hinton, M. Kwiatkowska, G. Norman, and D. Parker. PRISM: A tool for automatic verification of probabilistic systems. In Proc. of TACAS '06, pages 441-444. Springer, 2006.
8. E. Stark and G. Pemmasani. Implementation of a compositional performance analysis algorithm for probabilistic I/O automata. In Proc. of PAPM '99, pages 3-24. Prensas Universitarias de Zaragoza, 1999.
9. E. W. Stark. On behaviour equivalence for probabilistic I/O automata and its relationship to probabilistic bisimulation. J. Autom. Lang. Comb., 8(2):361-395, 2003.
10. E. W. Stark, R. Cleaveland, and S. A. Smolka. A process-algebraic language for probabilistic I/O automata. In R. M. Amadio and D. Lugiez, editors, CONCUR '03, pages 189-203. Springer-Verlag, 2003.
11. E. W. Stark and S. Smolka. Compositional analysis of expected delays in networks of probabilistic I/O automata. In LICS 98, pages 466-477. IEEE CS Press, 1998.
12. S.-H. Wu, S. A. Smolka, and E. W. Stark. Composition and behaviors of probabilistic I/O automata. Theor. Comput. Sci., 176(1-2):1-38, 1997.