Specification, testing and implementation relations for symbolic-probabilistic systems

Theoretical Computer Science

Volumn 353, Issue 1-3, 2006, Pages 228-248

  López, Natalia ^a   Núñez, Manuel ^a   Rodríguez, Ismael ^a  

^a UNIVERSIDAD COMPLUTENSE DE MADRID   (Spain)

Author keywords

Conformance testing; Symbolic probabilistic finite state machines; Test derivation and application

Indexed keywords

ALGORITHMS; FINITE AUTOMATA; MATHEMATICAL MODELS;

CONFORMANCE TESTING; SYMBOLIC-PROBABILISTIC FINITE STATE MACHINES;

PROBABILITY;

EID: 33244477173     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.10.047     Document Type: Article

References (27)

1. J. Baeten, and C. Middelburg Process Algebra With Timing, EATCS Monograph 2002 Springer Berlin
2. K. Bartlett, R. Scantlebury, and P. Wilkinson A note on reliable full-duplex transmission over half-duplex links Comm. ACM 12 5 1969 260 261
3. B. Beizer Black Box Testing 1995 Wiley New York
4. M. Bravetti, and A. Aldini Discrete time generative-reactive probabilistic processes with different advancing speeds Theoret. Comput. Sci. 290 1 2003 355 406
5. D. Cazorla, F. Cuartero, V. Valero, F. Pelayo, and J. Pardo Algebraic theory of probabilistic and non-deterministic processes J. Logic Algebraic Programming 55 1-2 2003 57 103
6. I. Christoff, Testing equivalences and fully abstract models for probabilistic processes, in: J.C.M. Baeten, J.W. Klop (Eds.), CONCUR'90, Lecture Notes in Computer Science, Vol. 458, Springer, Berlin, 1990, pp. 126-140.
7. R. Cleaveland, Z. Dayar, S. Smolka, and S. Yuen Testing preorders for probabilistic processes Inform. Comput. 154 2 1999 93 148
8. R. Cleaveland, G. Lüttgen, and V. Natarajan Priority in process algebra J. Bergstra A. Ponse S. Smolka Handbook of Process Algebra, Chap. 12 2001 North-Holland Amsterdam
9. R. de Nicola, and M. Hennessy Testing equivalences for processes Theoret. Comput. Sci. 34 1984 83 133
10. R.v. Glabbeek, S. Smolka, and B. Steffen Reactive, generative and stratified models of probabilistic processes Inform. Comput. 121 1 1995 59 80
11. M. Hennessy Algebraic Theory of Processes 1988 MIT Press Cambridge, MA
12. B. Jonsson, W. Yi, and K. Larsen Probabilistic extensions of process algebras J. Bergstra A. Ponse S. Smolka Handbook of Process Algebra, Chap. 11 2001 North-Holland Amsterdam
13. K. Larsen, and A. Skou Bisimulation through probabilistic testing Inform. Comput. 94 1 1991 1 28
14. N. López, M. Núñez, An overview of probabilistic process algebras and their equivalences, in: C. Baier, B.R. Haverkort, H. Hermanns, J.-P. Katoen, M. Siegle (Eds.), Validation of Stochastic Systems, Lecture Notes in Computer Science, Vol. 2925, Springer, Berlin, 2004, pp. 89-123.
15. N. López, M. Núñez, I. Rodríguez, Testing of symbolic-probabilistic systems, in: J. Grabowski, B. Nielsen (Eds.), Fourth Internat. Workshop on Formal Approaches to Testing of Software (FATES 2004), Lecture Notes in Computer Science, Vol. 3395, Springer, Berlin, 2004, pp. 49-63.
16. N. López, M. Núñez, I. Rodríguez, Formal specification of symbolic-probabilistic systems, in: M. Núñez, Z. Maamar, F.L. Pelayo, K. Pousttchi, F. Rubio (Eds.), European Performance Engineering Workshop (EPEW'04), Lecture Notes in Computer Science, Vol. 3236, Springer, Berlin, 2004, pp. 114-127.
17. G. Myers The Art of Software Testing 1979 Wiley New York
18. X. Nicollin, J. Sifakis, An overview and synthesis on timed process algebras, in: K.G. Larsen, A. Skou (Eds.), Computer Aided Verification'91, Lecture Notes in Computer Science, Vol. 575, Springer, Berlin, 1991, pp. 376-398.
19. M. Núñez Algebraic theory of probabilistic processes J. Logic Algebraic Programming 56 1-2 2003 117 177
20. M. Núñez, D. de Frutos, Testing semantics for probabilistic LOTOS, in: G. von Bochmann, R. Dssouli, O. Rafiq (Eds.), Formal Description Techniques VIII, Chapman & Hall, London, 1995, pp. 365-380.
21. M. Núñez, I. Rodríguez, Encoding PAMR into (timed) EFSMs, in: D. Peled, M.Y. Vardi (Eds.), FORTE 2002, Lecture Notes in Computer Science, Vol. 2529, Springer, Berlin, 2002, pp. 1-16.
22. M. Núñez, I. Rodríguez, Towards testing stochastic timed systems, in: H. König, M. Heiner, A. Wolisz (Eds.), FORTE 2003, Lecture Notes in Computer Science, Vol. 2767, Springer, Berlin, 2003, pp. 335-350.
23. G. Reed, and A. Roscoe A timed model for communicating sequential processes Theoret. Comput. Sci. 58 1988 249 261
24. R. Segala, Testing probabilistic automata, in: U. Montanari, V. Sassone (Eds.), CONCUR'96, Lecture Notes in Computer Science, Vol. 1119, Springer, Berlin, 1996, pp. 299-314.
25. M. Stoelinga, F. Vaandrager, A testing scenario for probabilistic automata, in: J.C.M. Baeten, J.K. Lenstra, J. Parrow, G.J. Woeginger (Eds.), ICALP 2003, Lecture Notes in Computer Science, Vol. 2719, Springer, Berlin, 2003, pp. 464-477.
26. J. Tretmans Test generation with inputs, outputs and repetitive quiescence Software - Concepts Tools 17 3 1996 103 120
27. W. Yi, K. Larsen, Testing probabilistic and nondeterministic processes, in: R.J. Linn Jr., M. Ümit Uyar (Eds.), Protocol Specification, Testing and Verification XII, North-Holland, Amsterdam, 1992, pp. 47-61.