Abstract
In this paper we consider the testing of systems where probabilistic information is not given by means of fixed values but as sets of probabilities. We will use an extension of finite state machine where choices among transitions labeled by the same input are probabilistically resolved. We will introduce our notion of test and we will define how tests are applied to the implementation under test (IUT). We will also present an implementation relation to assess the conformance, up to a level of confidence, of an implementation to a specification. In order to define this relation we will take finite samples of executions of the implementation and compare them with the probabilistic constraints imposed by the specification. Finally, we will give an algorithm for deriving sound and complete test suites with respect to this implementation relation.
Work supported by the Spanish MCyT project MASTER (TIC2003-07848-C02-01), the Junta de Castilla-La Mancha project DISMEF (PAC-03-001), and the Marie Curie project TAROT (MRTN-CT-2003-505121).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Baeten, J.C.M., Middelburg, C.A.: Process algebra with timing. In: EATCS Monograph. Springer, Heidelberg (2002)
Bartlett, K.A., Scantlebury, R.A., Wilkinson, P.T.: A note on reliable full-duplex transmission over half-duplex links. Communications of the ACM 12(5), 260–261 (1969)
Beizer, B.: Black Box Testing. John Wiley and Sons, Chichester (1995)
Bravetti, M., Aldini, A.: Discrete time generative-reactive probabilistic processes with different advancing speeds. Theoretical Computer Science 290(1), 355–406 (2003)
Cazorla, D., Cuartero, F., Valero, V., Pelayo, F.L., Pardo, J.J.: Algebraic theory of probabilistic and non-deterministic processes. Journal of Logic and Algebraic Programming 55(1-2), 57–103 (2003)
Christoff, I.: Testing equivalences and fully abstract models for probabilistic processes. In: Baeten, J.C.M., Klop, J.W. (eds.) CONCUR 1990. LNCS, vol. 458, pp. 126–140. Springer, Heidelberg (1990)
Cleaveland, R., Dayar, Z., Smolka, S.A., Yuen, S.: Testing preorders for probabilistic processes. Information and Computation 154(2), 93–148 (1999)
Cleaveland, R., Lüttgen, G., Natarajan, V.: Priority in process algebra. In: Bergstra, J.A., Ponse, A., Smolka, S.A. (eds.) Handbook of process algebra, ch. 12. North-Holland, Amsterdam (2001)
de Nicola, R., Hennessy, M.C.B.: Testing equivalences for processes. Theoretical Computer Science 34, 83–133 (1984)
van Glabbeek, R., Smolka, S.A., Steffen, B.: Reactive, generative and stratified models of probabilistic processes. Information and Computation 121(1), 59–80 (1995)
Hennessy, M.: Algebraic Theory of Processes. MIT Press, Cambridge (1988)
Larsen, K., Skou, A.: Bisimulation through probabilistic testing. Information and Computation 94(1), 1–28 (1991)
López, N., Núñez, M.: An overview of probabilistic process algebras and their equivalences. In: Baier, C., Haverkort, B.R., Hermanns, H., Katoen, J.-P., Siegle, M. (eds.) Validation of Stochastic Systems. LNCS, vol. 2925, pp. 89–123. Springer, Heidelberg (2004)
López, N., Núñez, M., Rodríguez, I.: Formal specification of symbolic-probabilistic systems. In: Núñez, M., Maamar, Z., Pelayo, F.L., Pousttchi, K., Rubio, F. (eds.) FORTE 2004. LNCS, vol. 3236, pp. 114–127. Springer, Heidelberg (2004) (In Press)
Myers, G.J.: The Art of Software Testing. John Wiley and Sons, Chichester (1979)
Nicollin, X., Sifakis, J.: An overview and synthesis on timed process algebras. In: Larsen, K.G., Skou, A. (eds.) CAV 1991. LNCS, vol. 575, pp. 376–398. Springer, Heidelberg (1991)
Núñez, M.: Algebraic theory of probabilistic processes. Journal of Logic and Algebraic Programming 56(1-2), 117–177 (2003)
Núñez, M., de Frutos, D.: Testing semantics for probabilistic LOTOS. In: Formal Description Techniques VIII, pp. 365–380. Chapman and Hall, Boca Raton (1995)
Núñez, M., Rodríguez, I.: Towards testing stochastic timed systems. In: König, H., Heiner, M., Wolisz, A. (eds.) FORTE 2003. LNCS, vol. 2767, pp. 335–350. Springer, Heidelberg (2003)
Reed, G.M., Roscoe, A.W.: A timed model for communicating sequential processes. Theoretical Computer Science 58, 249–261 (1988)
Rodríguez, I.: Especificación de sistemas concurrentes usando conceptos de teoría económica: Sintaxis, semántica, aplicaciones y extensiones del lenguaje formal PAMR. PhD thesis, Universidad Complutense de Madrid (2004)
Segala, R.: Testing probabilistic automata. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol. 1119, pp. 299–314. Springer, Heidelberg (1996)
Stoelinga, M., Vaandrager, F.: A testing scenario for probabilistic automata. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 464–477. Springer, Heidelberg (2003)
Tretmans, J.: Test generation with inputs, outputs and repetitive quiescence. Software – Concepts and Tools 17(3), 103–120 (1996)
Tretmans, J.: Testing concurrent systems: A formal approach. In: Baeten, J.C.M., Mauw, S. (eds.) CONCUR 1999. LNCS, vol. 1664, pp. 46–65. Springer, Heidelberg (1999)
Yi, W., Larsen, K.G.: Testing probabilistic and nondeterministic processes. In: Protocol Specification, Testing and Verification XII, pp. 47–61. North-Holland, Amsterdam (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 IFIP International Federation for Information Processing
About this paper
Cite this paper
López, N., Núñez, M., Rodríguez, I. (2005). Testing of Symbolic-Probabilistic Systems. In: Grabowski, J., Nielsen, B. (eds) Formal Approaches to Software Testing. FATES 2004. Lecture Notes in Computer Science, vol 3395. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31848-4_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-31848-4_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25109-5
Online ISBN: 978-3-540-31848-4
eBook Packages: Computer ScienceComputer Science (R0)